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

 

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

1,6

LINKS

Table of n, a(n) for n=1..83.

CROSSREFS

Sequence in context: A018118 A029084 A032229 * A218123 A288157 A333701

Adjacent sequences:  A024363 A024364 A024365 * A024367 A024368 A024369

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 06:36 EST 2022. Contains 350452 sequences. (Running on oeis4.)