Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105804
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105804 a(n)=F(n-1)a(n-1)+F(n)a(n-2), where F = A000045 (Fibonacci numbers), a(0)=0, a(1)=1. +0
1
0, 1, 1, 3, 9, 42, 282, 2802, 42348, 984576, 35804724, 2056887084, 188218830732, 2758276615980, 6497743050809304, 2466474617607855408, 1510962789131940581928, 1495259232837545099449512 (list; graph; listen)
OFFSET

0,4

CROSSREFS

Cf. A096655.

Sequence in context: A020128 A018965 A018995 this_sequence A009402 A009584 A013562

Adjacent sequences: A105801 A105802 A105803 this_sequence A105805 A105806 A105807

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Apr 20 2005

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