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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049669 a(n)=F(9n)/34, where F=A000045 (the Fibonacci sequence). 2
0, 1, 76, 5777, 439128, 33379505, 2537281508, 192866774113, 14660412114096, 1114384187445409, 84707858657965180, 6438911642192799089, 489441992665310695944, 37204030354205805690833 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

G.f. x/(1-76*x-x^2), 76=L(9)=A000032(9) (Lucas).

a(n)=76*a(n-1)+a(n-2), n>1 ; a(0)=0, a(1)=1 . [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 23 2008]

MAPLE

with (combinat):seq(fibonacci(3*n, 4)/17, n=0..13); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 20 2008

PROG

(Mupad) numlib::fibonacci(9*n)/34 $ n = 0..25; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 09 2008

CROSSREFS

A column of array A028412.

Sequence in context: A198530 A116264 A004299 * A198476 A139671 A098606

Adjacent sequences:  A049666 A049667 A049668 * A049670 A049671 A049672

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jan 20 2000

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 16 14:37 EST 2012. Contains 205930 sequences.