The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A360921

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

A360921

Maximum number of vertices in an induced tree in the n X n grid graph.
(history; published version)

#5 by Michael De Vlieger at Sun Feb 26 23:10:06 EST 2023

STATUS

proposed

approved

#4 by Andrew Howroyd at Sun Feb 26 22:15:44 EST 2023

STATUS

editing

proposed

#3 by Andrew Howroyd at Sun Feb 26 22:05:30 EST 2023

CROSSREFS

Cf. A331968, A357357, A360919 (maximum induced trees).

#2 by Andrew Howroyd at Sun Feb 26 22:04:09 EST 2023

NAME

allocated for Andrew HowroydMaximum number of vertices in an induced tree in the n X n grid graph.

DATA

1, 3, 7, 12, 19, 26, 36, 46, 59, 72, 87, 102, 120, 138, 159

OFFSET

1,2

LINKS

Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GridGraph.html">Grid Graph</a>.

FORMULA

a(n) >= A331968(n).

EXAMPLE

a(4) = 12:

O O O O

O O

O O O

CROSSREFS

Main diagonal of A360920.

Cf. A331968, A357357, A360919.

KEYWORD

allocated

nonn,more

AUTHOR

Andrew Howroyd, Feb 26 2023

STATUS

approved

editing

#1 by Andrew Howroyd at Sat Feb 25 14:44:59 EST 2023

NAME

allocated for Andrew Howroyd

KEYWORD

allocated

STATUS

approved