Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133592
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133592 a(n)=2*a(n-1)+6*a(n-2) for n>=3, a(0)=1, a(1)=2, a(2)=8 . +0
2
1, 2, 8, 28, 104, 376, 1376, 5008, 18272, 66592, 242816, 885184, 3227264, 11765632, 42894848, 156383488, 570136084, 2078573056, 7577962496, 27627363328, 100722501632, 367209183232, 1338753376256, 4880761851904, 17794043961344 (list; graph; listen)
OFFSET

0,2

FORMULA

G.f.: (1-2*x^2)/(1-2*x-6*x^2) . a(n) = Sum_{k, 0<=k<=n}A122950(n,k)*2^k .

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

((7+2*sqrt(7))/21)*(1+sqrt(7))^n+((7-2*sqrt(7))/21)*(1-sqrt(7))^n for n=>1 [From Richard Choulet (richardchoulet(AT)yahoo.fr), Nov 19 2008]

CROSSREFS

Sequence in context: A104934 A056711 A114590 this_sequence A115967 A150714 A122447

Adjacent sequences: A133589 A133590 A133591 this_sequence A133593 A133594 A133595

KEYWORD

easy,nonn,new

AUTHOR

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


AT&T Labs Research