A024890 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = A014306.

0, 0, 1, 0, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 2, 3, 3, 2, 3, 3, 2, 3, 3, 3, 3, 4, 4, 4, 4, 3, 4, 4, 3, 4, 4, 3, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 5, 5, 5, 6, 6, 5, 6, 6, 5, 5, 6, 6, 5, 6, 6, 6, 6, 5, 7, 7, 7, 7, 7, 6, 7, 7, 7, 7, 7, 7, 6, 7, 7, 6, 7, 7, 7, 8, 7, 8, 7, 8, 8, 8, 8, 7, 8, 7, 8, 8, 8, 7, 8, 8, 8, 8, 9, 8, 8, 9, 9, 9

Offset

2,9

Links

Table of n, a(n) for n=2..113.

Crossrefs

Sequence in context: A085761 A352884 A102382 * A254123 A007895 A053260

Adjacent sequences: A024887 A024888 A024889 * A024891 A024892 A024893

Keyword

nonn

Author

Clark Kimberling

Extensions

a(102) onward corrected by Sean A. Irvine, Jul 27 2019

Status

approved