login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025078 a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ] and s = (Fibonacci numbers). 0
1, 2, 5, 8, 19, 31, 65, 105, 210, 340, 654, 1058, 1985, 3212, 5911, 9564, 17345, 28065, 50305, 81395, 144516, 233832, 411900, 666468, 1166209, 1886966, 3283145, 5312240, 9197455, 14881795, 25655489, 41511453, 71293590, 115355452 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

CROSSREFS

Sequence in context: A037233 A133147 A082630 * A192780 A055614 A076870

Adjacent sequences:  A025075 A025076 A025077 * A025079 A025080 A025081

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 03 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 11:46 EST 2012. Contains 206011 sequences.