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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025128 a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A014306. 0
0, 0, 1, 0, 1, 2, 2, 2, 3, 2, 3, 4, 4, 4, 5, 5, 6, 7, 7, 6, 7, 8, 8, 8, 9, 9, 10, 11, 11, 11, 12, 12, 13, 13, 13, 13, 15, 15, 15, 15, 16, 16, 18, 17, 18, 18, 19, 19, 20, 20, 21, 21, 23, 22, 23, 22, 23, 24, 24, 24, 25, 25, 26, 27, 27, 27, 28, 29, 29, 29, 30, 30, 31, 32, 32, 32, 33, 33, 34, 34, 35, 35, 36 (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: A194296 A194336 A127159 * A058769 A194312 A116997

Adjacent sequences:  A025125 A025126 A025127 * A025129 A025130 A025131

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 July 20 16:15 EDT 2019. Contains 325185 sequences. (Running on oeis4.)