Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049679
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049679 a(n)=(F(8n+7)+F(8n+5))/3, where F=A000045 (the Fibonacci sequence). +0
1
6, 281, 13201, 620166, 29134601, 1368706081, 64300051206, 3020733700601, 141910183877041, 6666757908520326, 313195711516578281, 14713531683370658881, 691222793406904389126, 32472757758441135630041 (list; graph; listen)
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: A015020 A003384 A033289 this_sequence A128792 A027875 A042119

Adjacent sequences: A049676 A049677 A049678 this_sequence A049680 A049681 A049682

KEYWORD

nonn,new

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

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

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 December 3 14:12 EST 2008. Contains 151279 sequences.


AT&T Labs Research