Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135934
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135934 O.g.f.: A(x) = Sum_{n>=0} x^n / Product_{k=0..n} (1 - fibonacci(k)*x). +0
1
1, 1, 2, 4, 9, 24, 77, 299, 1419, 8312, 60452, 547939, 6213566, 88468601, 1585646789, 35846274127, 1023893974778, 37005881297226, 1694206791508891, 98335493373334998, 7241161595237290969, 676871453643079089963 (list; graph; listen)
OFFSET

0,3

EXAMPLE

A(x) = 1 + x/(1-x) + x^2/((1-x)(1-x)) + x^3/((1-x)(1-x)(1-2x)) +

x^4/((1-x)(1-x)(1-2x)(1-3x)) + x^5/((1-x)(1-x)(1-2x)(1-3x)(1-5x)) +

x^6/((1-x)(1-x)(1-2x)(1-3x)(1-5x)(1-8x)) +...

PROGRAM

(PARI) {a(n)=polcoeff(sum(k=0, n, x^k/prod(j=0, k, 1-fibonacci(j)*x+x*O(x^n))), n)}

CROSSREFS

Cf. A000045.

Sequence in context: A000667 A131351 A091352 this_sequence A137154 A098448 A006406

Adjacent sequences: A135931 A135932 A135933 this_sequence A135935 A135936 A135937

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Dec 07 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research