login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A123750 Number of distinct resistances possible with at most n arbitrary resistors connected in series or in parallel. 0
0, 1, 4, 17, 94, 667, 5752, 58053, 669970, 8698991, 125499820, 1991637529, 34479906886, 646671878595, 13061304372448, 282652185684845, 6524494505342842, 160018549741811479, 4155443426929596436 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

The difference between this problem and A005840 and A051045 is the word "at most". In this problem, at most n different resistors are used to generate all possible resistances using in series and in parallel wirings, also including resistances where some of the resistors from the collection 1,2,...,n, are not used.

LINKS

I. N. Galidakis, Home Page (listed in lieu of email address)

FORMULA

a(n) = 2*A005840(n) + n - 2; generating function = exp(x)*(-2*exp(x) + exp(x)*x + 2)/(-2 + exp(x))

EXAMPLE

exp(x)*(-2*exp(x) + exp(x)*x + 2)/(-2 + exp(x)) = 1*x + 2*x^2 + 17/6*x^3 + 47/12*x^4 + 667/120*x^5 + 719/90*x^6 + 19351/1680*x^7 + O(x^8); then the coefficients are multiplied by n! to get 1, 4, 17, 94, 667, 5752, 58053, 669970, 8698991, ...

MAPLE

series(exp(x)*(-2*exp(x) + exp(x)*x + 2)/(-2 + exp(x)), x, 8);

CROSSREFS

Cf. A005840. a(n) = 2*A005840(n) + n - 2, n > 1; A051045.

Sequence in context: A112354 A020011 A067084 * A024052 A128321 A091635

Adjacent sequences:  A123747 A123748 A123749 * A123751 A123752 A123753

KEYWORD

nonn

AUTHOR

I. N. Galidakis (jgal(AT)ath.forthnet.gr), Nov 28 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 09:48 EST 2012. Contains 205451 sequences.