Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A016153
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A016153 (9^n-4^n)/5. +0
4
0, 1, 13, 133, 1261, 11605, 105469, 953317, 8596237, 77431669, 697147165, 6275373061, 56482551853, 508359743893, 4575304803901, 41178011670565, 370603178776909, 3335432903959477, 30018913315504477, 270170288559017029 (list; graph; listen)
OFFSET

0,3

COMMENT

a(n) is also the coefficient of x^(n-1) in the bivariate Fibonacci polynomials F(n)(x,y)=xF(n-1)(x,y)+yF(n-2)(x,y),F(0)(x,y)=0,F(1)(x,y)=1, when we write 13x for x and -36x^2 for y. - Mario Catalani (mario.catalani(AT)unito.it), Dec 09 2002

FORMULA

G.f.: x/((1-4*x)*(1-9*x)). a(n)=13*a(n-1)-36*a(n-2).

PROGRAM

(PARI) a(n)=(9^n-4^n)/5

CROSSREFS

A016153(n)=A015441(2*n)

Sequence in context: A037715 A037617 A081042 this_sequence A031138 A097166 A073556

Adjacent sequences: A016150 A016151 A016152 this_sequence A016154 A016155 A016156

KEYWORD

nonn

AUTHOR

njas

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research