Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081570
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081570 Fifth binomial transform of F(n+1). +0
5
1, 6, 37, 233, 1490, 9633, 62753, 410926, 2700349, 17786985, 117346714, 774991289, 5121849473, 33865596822, 223987930325, 1481764925737, 9803764203682, 64870223394129, 429263295428641, 2840659771285310, 18798621916707821 (list; graph; listen)
OFFSET

0,2

COMMENT

Binomial transform of A081569 Case k=5 of family of recurrences a(n)=(2k+1)a(n-1)-A028387(k-1)a(n-2),a(0)=1,a(1)=k+1.

FORMULA

a(n)=11a(n-1)-29a(n-2), a(0)=1, a(1)=6. a(n)=(1/2 - sqrt(5)/10)(11/2 - sqrt(5)/2)^n + (sqrt(5)/10 + 1/2)*(sqrt(5)/2 + 11/2)^n . G.f.: (1-5x)/(1-11x+29x^2).

CROSSREFS

Cf. A000045.

Sequence in context: A005668 A018904 A076026 this_sequence A122898 A081912 A081188

Adjacent sequences: A081567 A081568 A081569 this_sequence A081571 A081572 A081573

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Mar 22 2003

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 September 8 13:07 EDT 2008. Contains 143486 sequences.


AT&T Labs Research