Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049677
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049677 a(n)=(F(8n+6)+F(8n+1))/3, where F=A000045 (the Fibonacci sequence). +0
1
3, 137, 6436, 302355, 14204249, 667297348, 31348771107, 1472724944681, 69186723628900, 3250303285613619, 152695067700211193, 7173417878624312452, 336997945227642474051, 15831730007820571967945 (list; graph; listen)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

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

CROSSREFS

Sequence in context: A136411 A037120 A082923 this_sequence A030247 A139956 A016067

Adjacent sequences: A049674 A049675 A049676 this_sequence A049678 A049679 A049680

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research