Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133642
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133642 a(n)=4*a(n-1)+20*a(n-2) for n>=3, a(0)=1, a(1)=4, a(2)=32 . +0
2
1, 4, 32, 208, 1472, 10048, 69632, 479488, 3310592, 22832128, 157540352, 1086803968, 7498022912, 51728171008, 356873142272, 2462055989848, 16985686802432, 117183866994688, 808449204027392, 5577474156003328 (list; graph; listen)
OFFSET

0,2

FORMULA

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

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

CROSSREFS

Sequence in context: A099133 A043018 A002012 this_sequence A098981 A120917 A099269

Adjacent sequences: A133639 A133640 A133641 this_sequence A133643 A133644 A133645

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