Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136726
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136726 G.f.: A(x) = Sum_{n>=0} log( Sum_{k>=0} fibonacci(k+1)^n*x^k )^n / n!. +0
1
1, 1, 2, 5, 17, 73, 407, 2907, 26773, 317954, 4886310, 97485657, 2534891399, 86295825506, 3863685633735, 228686666560004, 17979843031304262, 1888025173840826426, 266025611085446537560, 50572458313046091569640 (list; graph; listen)
OFFSET

0,3

EXAMPLE

G.f.: A(x) = 1 + x + 2x^2 + 5x^3 + 17x^4 + 73x^5 + 407x^6 + 2907x^7 +...

A(x) = Sum_{n>=0} log(1 + x + 2^n*x^2 + 3^n*x^3 + 5^n*x^4 +...)^n / n!;

this sum yields a series in x with integer coefficients.

PROGRAM

(PARI) {a(n)=polcoeff(sum(i=0, n, log(sum(k=0, n, fibonacci(k+1)^i*x^k)+x*O(x^n))^i/i!), n)}

CROSSREFS

Cf. A136553.

Adjacent sequences: A136723 A136724 A136725 this_sequence A136727 A136728 A136729

Sequence in context: A102038 A002135 A007868 this_sequence A112831 A000774 A081046

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jan 20 2008

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 January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research