login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A339386 a(n) is the number of non-isomorphic, serial/parallel indecomposable resistor networks with n edges. (Erroneous version of A338487) 1
1, 5, 37, 226, 1460, 9235 (list; graph; refs; listen; history; text; internal format)
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: A095924 A270019 A179567 * A088582 A088583 A202556

Adjacent sequences:  A339383 A339384 A339385 * A339387 A339388 A339389

KEYWORD

dead

AUTHOR

Rainer Rosenthal, Dec 02 2020

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 05:55 EDT 2021. Contains 343199 sequences. (Running on oeis4.)