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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049679 a(n)=(F(8n+7)+F(8n+5))/3, where F=A000045 (the Fibonacci sequence). 0
6, 281, 13201, 620166, 29134601, 1368706081, 64300051206, 3020733700601, 141910183877041, 6666757908520326, 313195711516578281, 14713531683370658881, 691222793406904389126, 32472757758441135630041 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n)=47*a(n-1)-a(n-2) ; a(0)=6, a(1)=281. G.f.: (6-x)/(1-47x+x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 18 2008]

CROSSREFS

Sequence in context: A199097 A199093 A163015 * A201139 A172660 A203051

Adjacent sequences:  A049676 A049677 A049678 * A049680 A049681 A049682

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

Corrected and extended by T. D. Noe (noe(AT)sspectra.com), Nov 07 2006

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 21:13 EST 2012. Contains 206085 sequences.