A339386 Erroneous version of A338487.

1, 5, 37, 226, 1460, 9235

Offset

5,2

Comments

Karnofsky 2004, p. 2: "Based on computations described below, the number of non-isomorphic, serial/parallel indecomposable graphs with number of edges from five through ten respectively is: 1, 5, 37, 226, 1460, 9235." These number are erroneous and the correct values given in A338487.

Links

Table of n, a(n) for n=5..10.

Joel Karnofsky, Solution of problem from Technology Review's Puzzle Corner Oct 3, 2003, Feb 23 2004.

Crossrefs

Sequence in context: A270019 A179567 A362337 * A088582 A088583 A202556

Adjacent sequences: A339383 A339384 A339385 * A339387 A339388 A339389

Keyword

dead

Author

Rainer Rosenthal, Dec 02 2020

Status

approved