login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081568 Third binomial transform of F(n+1). 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; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

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).

a(n)= Sum_{k, 0<=k<=n} A094441(n,k)*3^k. [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Dec 14 2009]

CROSSREFS

Cf. A000045.

Sequence in context: A086351 A049027 A026751 * A026378 A151247 A117439

Adjacent sequences:  A081565 A081566 A081567 * A081569 A081570 A081571

KEYWORD

easy,nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:04 EST 2012. Contains 205686 sequences.