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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049667 a(n)=F(7n)/13, where F=A000045 (the Fibonacci sequence). 8
0, 1, 29, 842, 24447, 709805, 20608792, 598364773, 17373187209, 504420793834, 14645576208395, 425226130837289, 12346203370489776, 358465123875040793, 10407834795746672773, 302185674200528551210, 8773792386611074657863 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

G.f. x/(1-29*x-x^2).

a(n)=F(n, 29), the n-th Fibonacci polynomial evaluated at x=29. - T. D. Noe (noe(AT)sspectra.com), Jan 19 2006

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

MATHEMATICA

a=0; lst={a}; s=0; Do[a=s-(a-1); AppendTo[lst, a]; s+=a*29, {n, 3*4!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 27 2009]

PROG

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

(Other) sage: [fibonacci(7*n)/13 for n in xrange(0, 17)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 15 2009]

CROSSREFS

A column of array A028412.

Cf. A134498.

Sequence in context: A171303 A009973 A057687 * A042626 A157877 A158665

Adjacent sequences:  A049664 A049665 A049666 * A049668 A049669 A049670

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 17 23:33 EST 2012. Contains 206085 sequences.