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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025066 a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ] and s = A023532. 0
0, 1, 1, 0, 2, 1, 2, 2, 3, 2, 3, 4, 3, 4, 4, 5, 6, 5, 5, 6, 7, 6, 8, 7, 8, 8, 10, 8, 9, 10, 10, 11, 11, 11, 12, 11, 12, 14, 14, 13, 14, 15, 14, 15, 16, 15, 18, 16, 17, 17, 19, 19, 19, 19, 19, 20, 21, 20, 21, 22, 23, 23, 23, 22, 24, 24, 24, 26, 26, 25, 26, 28, 27, 27, 28, 27, 31, 28, 30, 30, 30, 30, 32, 32 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

CROSSREFS

Sequence in context: A029263 A097575 A103273 * A172245 A051275 A025799

Adjacent sequences:  A025063 A025064 A025065 * A025067 A025068 A025069

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 16 10:53 EST 2012. Contains 205904 sequences.