login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)

Revision History for A296515

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
A296515
Number of edges in a maximal planar graph with n vertices.
(history; published version)
#166 by Joerg Arndt at Sun Feb 18 02:09:17 EST 2024
STATUS

reviewed

approved

#165 by Stefano Spezia at Sun Feb 18 01:51:34 EST 2024
STATUS

proposed

reviewed

#164 by Michel Marcus at Sun Feb 18 01:42:16 EST 2024
STATUS

editing

proposed

#163 by Michel Marcus at Sun Feb 18 01:42:13 EST 2024
LINKS

A. Allan Bickle, <a href="https://doi.org/10.7151/dmgt.1637">Structural results on maximal k-degenerate graphs</a>, Discuss. Math. Graph Theory 32 4 (2012), 659-676.

Allan Bickle, <a href="https://digitalcommons.georgiasoutherndoi.edu/cgiorg/viewcontent10.cgi?article=1409&amp;context=20429/tag.2024.000105">A Survey of Maximal k-degenerate Graphs and k-Trees</a>, Theory and Applications of Graphs 0 1 (2024) Article 5.

STATUS

proposed

editing

#162 by Allan Bickle at Sun Feb 18 01:41:36 EST 2024
STATUS

editing

proposed

#161 by Allan Bickle at Sun Feb 18 01:41:30 EST 2024
LINKS

Allan Bickle, <a href="https://digitalcommons.georgiasouthern.edu/cgi/viewcontent.cgi?article=1409&amp;context=tag">A Survey of Maximal k-degenerate Graphs and k-Trees</a>, Theory and Applications of Graphs 0 1 (2024) Article 5.

STATUS

approved

editing

#160 by N. J. A. Sloane at Wed Nov 22 22:12:12 EST 2023
STATUS

proposed

approved

#159 by Andrew Howroyd at Thu Oct 19 15:11:37 EDT 2023
STATUS

editing

proposed

Discussion
Thu Oct 19
21:03
Max R Anderson: No, the restriction is necessary, at least in the context of Minecraft. If you dig a hole less than 3 blocks deep the formula does apply.
Fri Oct 20
11:50
Max R Anderson: Apologies, correction of typo in my last comment: If you dig a hole less than 3 blocks deep the formula does *not apply.
13:51
Andrew Howroyd: a(n) means the sequence not the formula. The sequence is what is shown in the DATA field. The restriction n >= 3 is needed for the formula, but not for the comment. My understanding is that no restriction is needed for the comment. Otherwise we are back to this is not the correct sequence for the comment. If you dig a hole of 1 is the correct answer 0? and if you dig a hole of 2 is the correct answer 1? If the answer to both of these questions is yes then we are good.
13:55
Andrew Howroyd: In this sequence if you look at the DATA field (and not the formula) you will see a(0) = 0, a(1) = 0, a(2) = 1, a(3) = 3.
14:32
Max R Anderson: Andrew, okay I understand now. The answer to both of your questions is yes! Apologies for the confusion.
#158 by Andrew Howroyd at Thu Oct 19 15:08:40 EDT 2023
COMMENTS

For n > 2, a(n) is the number of blocks to dig (in a staircase fashion) to get out of a hole of depth n in Minecraft. - Max R Anderson, Oct 19 2023

STATUS

proposed

editing

Discussion
Thu Oct 19
15:11
Andrew Howroyd: The n > 2 restriction is unnecessary in the comment. I have removed the qualification (see link, reply by K. Jiang). So this is the correct sequence for all n.
#157 by Andrew Howroyd at Thu Oct 19 13:19:56 EDT 2023
STATUS

editing

proposed

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified September 30 08:12 EDT 2024. Contains 376325 sequences.
License Agreements, Terms of Use, Privacy Policy