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!)
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
CROSSREFS
Sequence in context: A295138 A023864 A024857 * A024591 A350711 A309465
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 01:34 EDT 2024. Contains 370952 sequences. (Running on oeis4.)