login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024461 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (composite numbers). 0
4, 6, 14, 17, 35, 40, 73, 83, 145, 166, 281, 312, 519, 561, 923, 1000, 1635, 1783, 2904, 3117, 5064, 5335, 8654, 9132, 14800, 15677, 25391, 26470, 42857, 44697, 72350, 75573, 122310, 128165, 207407, 218556, 353665, 369326, 597617, 616728, 997923, 1030248 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

CROSSREFS

Sequence in context: A310639 A310640 A310641 * A063811 A310642 A310643

Adjacent sequences:  A024458 A024459 A024460 * A024462 A024463 A024464

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 29 16:58 EST 2020. Contains 331347 sequences. (Running on oeis4.)