Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081568
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081568 Third binomial transform of F(n+1). +0
4
1, 4, 17, 75, 338, 1541, 7069, 32532, 149965, 691903, 3193706, 14745009, 68084297, 314394980, 1451837593, 6704518371, 30961415074, 142980203437, 660285858245, 3049218769908, 14081386948661, 65028302171639, 300302858766202 (list; graph; listen)
OFFSET

0,2

COMMENT

Binomial transform of A081567. Case k=3 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)=7a(n-1)-11a(n-2), a(0)=1, a(1)=4. a(n)=(1/2 - sqrt(5)/10)(7/2 - sqrt(5)/2)^n + (sqrt(5)/10 + 1/2)(sqrt(5)/2 + 7/2)^n G.f.: (1-3x)/(1-7x+11x^2).

CROSSREFS

Cf. A000045.

Sequence in context: A086351 A049027 A026751 this_sequence A026378 A151247 A117439

Adjacent sequences: A081565 A081566 A081567 this_sequence A081569 A081570 A081571

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research