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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049668 a(n)=F(8n)/21, where F=A000045 (the Fibonacci sequence). 6
0, 1, 47, 2208, 103729, 4873055, 228929856, 10754830177, 505248088463, 23735905327584, 1115082302307985, 52385132303147711, 2460986135945634432, 115613963257141670593, 5431395286949712883439, 255159964523379363851040 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..15.

Tanya Khovanova, Recursive Sequences

FORMULA

G.f. x/(1-47*x+x^2), 47=L(8)=A000032(8) (Lucas).

a(n)=47*a(n-1)-a(n-2) ; a(0)=0, a(1)=1. [From Philippe DELEHAM, Nov 18 2008]

PROG

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

CROSSREFS

A column of array A028412.

Sequence in context: A170728 A170766 A218749 * A009991 A052463 A005148

Adjacent sequences:  A049665 A049666 A049667 * A049669 A049670 A049671

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

More terms from James A. Sellers, Jan 20 2000

STATUS

approved

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 May 21 07:04 EDT 2013. Contains 225477 sequences.