Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049686
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049686 a(n)=F(8n)/3, where F=A000045 (the Fibonacci sequence). +0
1
0, 7, 329, 15456, 726103, 34111385, 1602508992, 75283811239, 3536736619241, 166151337293088, 7805576116155895, 366695926122033977, 17226902951619441024, 809297742799991694151, 38019767008647990184073 (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)=0, a(1)=7. G.f.: 7*x/(1-47*x+x^2).

CROSSREFS

A049686(n) = A004187(2n).

Sequence in context: A109059 A002000 A092588 this_sequence A009587 A054325 A068150

Adjacent sequences: A049683 A049684 A049685 this_sequence A049687 A049688 A049689

KEYWORD

nonn,easy

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 8 18:40 EDT 2008. Contains 141013 sequences.


AT&T Labs Research