Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A166168
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A166168 G.f.: exp( Sum_{n>=1} Lucas(n^2)*x^n/n ) where Lucas(n) = A000204(n). +0
3
1, 1, 4, 29, 585, 34212, 5600397, 2490542953, 2968152042068, 9416588994339205, 79216509536543420965, 1762508872870620792746360, 103525263562786817866762466405, 16031370626878431551103688398524485 (list; graph; listen)
OFFSET

0,3

COMMENT

Conjectured to consist entirely of integers.

The Lucas numbers (A000204) forms the logarithmic derivative of the Fibonacci numbers (A000045).

Note that Lucas(n^2) = [(1+sqrt(5))/2]^(n^2) + [(1-sqrt(5))/2]^(n^2).

FORMULA

a(n) = (1/n)*Sum_{k=1..n} Lucas(k^2)*a(n-k), a(0)=1.

Logarithmic derivative yields A166169.

EXAMPLE

G.f.: A(x) = 1 + x + 4*x^2 + 29*x^3 + 585*x^4 + 34212*x^5 +...

log(A(x)) = x + 7*x^2/2 + 76*x^3/3 + 2207*x^4/4 + 167761*x^5/5 + 33385282*x^6/6 +...+ Lucas(n^2)*x^n/n +...

PROGRAM

(PARI) {a(n)=polcoeff(exp(sum(m=1, n, (fibonacci(m^2-1)+fibonacci(m^2+1))*x^m/m)+x*O(x^n)), n)}

CROSSREFS

Cf. A166169, A156216, A155200, A000204, A000045.

Sequence in context: A000798 A135485 A162287 this_sequence A126559 A159862 A164820

Adjacent sequences: A166165 A166166 A166167 this_sequence A166169 A166170 A166171

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Oct 08 2009

page 1

Search completed in 0.006 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research