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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049676 a(n)=(F(8n+3)+F(8n+1))/3, where F=A000045 (the Fibonacci sequence). 0
1, 41, 1926, 90481, 4250681, 199691526, 9381251041, 440719107401, 20704416796806, 972666870342481, 45694638489299801, 2146675342126748166, 100848046441467864001, 4737711507406862859881, 222571592801681086550406 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

Tanya Khovanova, Recursive Sequences

FORMULA

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

CROSSREFS

Sequence in context: A218743 A009985 A147521 * A080178 A223384 A211907

Adjacent sequences:  A049673 A049674 A049675 * A049677 A049678 A049679

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 10:19 EDT 2013. Contains 225478 sequences.