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!)
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

%I #3 Mar 30 2012 18:55:54

%S 4,6,14,17,35,40,73,83,145,166,281,312,519,561,923,1000,1635,1783,

%T 2904,3117,5064,5335,8654,9132,14800,15677,25391,26470,42857,44697,

%U 72350,75573,122310,128165,207407,218556,353665,369326,597617,616728,997923,1030248

%N 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).

%K nonn

%O 1,1

%A _Clark Kimberling_

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 September 24 19:02 EDT 2023. Contains 365581 sequences. (Running on oeis4.)