Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133577
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133577 a(n)=a(n-1)+10*a(n-2) for n>=2, a(0)=1, a(1)=2 . +0
2
1, 2, 12, 32, 152, 472, 1992, 6712, 26632, 93752, 360072, 1297592, 4898312, 17874232, 66857352, 245599672, 914173192, 3370169912, 12511901832, 46213600952, 171332619272, 633468628792, 2346794821512, 8681481109432 (list; graph; listen)
OFFSET

0,2

FORMULA

G.f.: (1+x)/(1-x-10*x^2) .

a(n)=Sum_{k, 0<=k<=n+1}A122950(n+1,k)*9^(n+1-k). - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jan 08 2008

a(n)=(1/2)*[(1/2)-(1/2)*sqrt(41)]^n+(3/82)*sqrt(41)*[(1/2)+(1/2)*sqrt(41)]^n-(3/82)*sqrt(41)*[(1/2)-(1 /2)*sqrt(41)]^n+(1/2)*[(1/2)+(1/2)*sqrt(41)]^n, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Nov 18 2008]

CROSSREFS

Sequence in context: A013198 A092345 A000647 this_sequence A106185 A098203 A055707

Adjacent sequences: A133574 A133575 A133576 this_sequence A133578 A133579 A133580

KEYWORD

easy,nonn,new

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jan 03 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 December 4 20:00 EST 2008. Contains 151309 sequences.


AT&T Labs Research