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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024481 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (F(2), F(3), ...). 0
1, 2, 7, 11, 27, 44, 96, 155, 307, 497, 947, 1532, 2752, 4453, 7783, 12593, 21421, 34660, 58128, 94053, 156357, 252991, 416571, 674026, 1104546, 1787193, 2916749, 4719399, 7678589 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

CROSSREFS

Sequence in context: A295138 A023864 A024857 * A024591 A073602 A057025

Adjacent sequences:  A024478 A024479 A024480 * A024482 A024483 A024484

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 16 03:55 EST 2019. Contains 319184 sequences. (Running on oeis4.)