The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A024880 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = A023532. 0
 0, 0, 1, 1, 0, 1, 1, 1, 1, 2, 2, 1, 2, 1, 2, 2, 2, 3, 3, 2, 2, 3, 2, 3, 3, 3, 2, 4, 4, 3, 4, 3, 4, 3, 3, 4, 4, 3, 4, 5, 5, 4, 5, 4, 4, 5, 3, 5, 5, 5, 4, 5, 5, 5, 6, 5, 5, 6, 6, 5, 5, 5, 6, 6, 5, 5, 6, 5, 6, 7, 7, 5, 7, 7, 7, 7, 4, 7, 6, 6, 7, 7, 6, 6, 7, 7, 7, 8, 7, 6, 8, 8, 7, 8, 7, 7, 7, 7, 8, 8, 8, 6, 8, 7, 8, 8, 7, 8, 9, 8, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,10 LINKS Table of n, a(n) for n=2..112. CROSSREFS Sequence in context: A102820 A355717 A024317 * A029424 A061498 A106029 Adjacent sequences: A024877 A024878 A024879 * A024881 A024882 A024883 KEYWORD nonn AUTHOR Clark Kimberling STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 28 20:32 EDT 2023. Contains 365737 sequences. (Running on oeis4.)