Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049678
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049678 a(n)=F(8n+4)/3, where F=A000045 (the Fibonacci sequence). +0
1
1, 48, 2255, 105937, 4976784, 233802911, 10983760033, 516002918640, 24241153416047, 1138818207635569, 53500214605455696, 2513371268248782143, 118074949393087305025, 5547009250206854554032 (list; graph; listen)
OFFSET

0,2

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n) = 47*a(n-1) - a(n-2), n>1. a(0)=1, a(1)=48.

G.f.: (1+x)/(1-47*x+x^2).

CROSSREFS

A049678(n) = A049653(2n+1).

Sequence in context: A004386 A076003 A008845 this_sequence A063822 A009992 A042105

Adjacent sequences: A049675 A049676 A049677 this_sequence A049679 A049680 A049681

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

Better description and more terms from Michael Somos

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research