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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025115 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A023533. 0
0, 0, 1, 3, 5, 0, 0, 0, 1, 3, 5, 7, 9, 11, 13, 15, 17, 0, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 32, 36, 40, 44, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 44, 48, 52, 56, 60, 64, 68, 72, 76, 80, 84, 88, 92, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

CROSSREFS

Sequence in context: A161838 A152624 A059107 * A230424 A113037 A063866

Adjacent sequences:  A025112 A025113 A025114 * A025116 A025117 A025118

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 5 13:49 EST 2016. Contains 278768 sequences.