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!)
A025101 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (F(2), F(3), F(4), ...). 0
2, 3, 11, 18, 44, 71, 155, 251, 497, 804, 1532, 2479, 4453, 7205, 12593, 20376, 34660, 56081, 94053, 152181, 252991, 409348, 674026, 1090597, 1787193, 2891739, 4719399, 7636148 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
CROSSREFS
Sequence in context: A267420 A322422 A024861 * A025105 A257979 A365374
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 April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)