Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025078
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
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; listen)
OFFSET

1,2

CROSSREFS

Adjacent sequences: A025075 A025076 A025077 this_sequence A025079 A025080 A025081

Sequence in context: A037233 A133147 A082630 this_sequence A055614 A076870 A127281

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 03 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 October 6 16:13 EDT 2008. Contains 144667 sequences.


AT&T Labs Research