Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049676
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049676 a(n)=(F(8n+3)+F(8n+1))/3, where F=A000045 (the Fibonacci sequence). +0
1
1, 41, 1926, 90481, 4250681, 199691526, 9381251041, 440719107401, 20704416796806, 972666870342481, 45694638489299801, 2146675342126748166, 100848046441467864001, 4737711507406862859881, 222571592801681086550406 (list; graph; listen)
OFFSET

0,2

LINKS

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 (kolotoko(AT)wanadoo.fr), Nov 18 2008]

CROSSREFS

Sequence in context: A144747 A009985 A147521 this_sequence A080178 A107690 A068815

Adjacent sequences: A049673 A049674 A049675 this_sequence A049677 A049678 A049679

KEYWORD

nonn,new

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jan 20 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 December 3 14:12 EST 2008. Contains 151279 sequences.


AT&T Labs Research