login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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; text; internal format)
OFFSET

1,5

LINKS

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

CROSSREFS

Sequence in context: A097575 A103273 A289120 * A060426 A260412 A283451

Adjacent sequences:  A025063 A025064 A025065 * A025067 A025068 A025069

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 June 2 08:23 EDT 2020. Contains 334767 sequences. (Running on oeis4.)