|
%I #27 Feb 21 2023 12:43:35
%S 1,5,37,226,1460,9235
%N Erroneous version of A338487.
%C 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.
%H Joel Karnofsky, <a href="http://cs.nyu.edu/~gottlieb/tr/overflow/2003-dec-2.pdf">Solution of problem from Technology Review's Puzzle Corner Oct 3, 2003</a>, Feb 23 2004.
%K dead
%O 5,2
%A _Rainer Rosenthal_, Dec 02 2020
|
