The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A005418 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A005418

Number of (n-1)-bead black-white reversible strings; also binary grids; also row sums of Losanitsch's triangle A034851; also number of caterpillar graphs on n+2 vertices.
(history; published version)

#323 by Charles R Greathouse IV at Sun Feb 16 08:32:28 EST 2025

LINKS

Eric Weisstein's World of Mathematics, <a href="httphttps://mathworld.wolfram.com/BarkerCode.html">Barker Code</a>.

Eric Weisstein's World of Mathematics, <a href="httphttps://mathworld.wolfram.com/BishopsProblem.html">Bishops Problem</a>.

Eric Weisstein's World of Mathematics, <a href="httphttps://mathworld.wolfram.com/CaterpillarGraph.html">Caterpillar Graph</a>.

Eric Weisstein's World of Mathematics, <a href="httphttps://mathworld.wolfram.com/LosanitschsTriangle.html">Losanitsch's Triangle</a>.

Discussion

Sun Feb 16

08:32

OEIS Server: https://oeis.org/edit/global/3014

#322 by Andrey Zabolotskiy at Tue Oct 01 16:40:53 EDT 2024

STATUS

editing

approved

#321 by Andrey Zabolotskiy at Tue Oct 01 16:40:50 EDT 2024

COMMENTS

a(n) is is also the number of distinct planar embeddings of the 2 X (n+2) grid graph i.e., the (n+2)-ladder graph. - Eric W. Weisstein, May 21 2024

STATUS

approved

editing

#320 by Michael De Vlieger at Tue May 21 13:44:25 EDT 2024

STATUS

proposed

approved

#319 by Eric W. Weisstein at Tue May 21 10:08:25 EDT 2024

STATUS

editing

proposed

#318 by Eric W. Weisstein at Tue May 21 10:08:21 EDT 2024

COMMENTS

a(n) is is also the number of distinct planar embeddings of the 2 X (n+2) grid graph i.e., the (n+2)-ladder graph. - Eric W. Weisstein, May 21 2024

LINKS

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

STATUS

proposed

editing

#317 by Eric W. Weisstein at Tue May 21 10:01:17 EDT 2024

STATUS

editing

proposed

#316 by Eric W. Weisstein at Tue May 21 10:01:15 EDT 2024

COMMENTS

a(n) is also the number of distinct planar embeddings in of the (n+2)-centipede graph (up to at least n=8 and likely for all larger n). - Eric W. Weisstein, May 21 2024

a(n) is is also the number of distinct planar embeddings of the 2 X (n+2) grid graph. - Eric W. Weisstein, May 21 2024

LINKS

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

STATUS

approved

editing

#315 by Michael De Vlieger at Tue May 21 08:46:46 EDT 2024

STATUS

proposed

approved

#314 by Eric W. Weisstein at Tue May 21 07:59:29 EDT 2024

STATUS

editing

proposed