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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024317 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k=[ (n+1)/2) ], s = A023531, t = A023532. 0
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 (list; graph; refs; listen; history; internal format)
OFFSET

1,11

CROSSREFS

Sequence in context: A003643 A058062 A102820 * A024880 A029424 A061498

Adjacent sequences:  A024314 A024315 A024316 * A024318 A024319 A024320

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 17 16:49 EST 2012. Contains 206058 sequences.