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!)
A025104 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers). 0

%I

%S 12,20,58,78,154,190,307,361,525,599,829,927,1235,1361,1742,1898,2358,

%T 2546,3112,3336,4020,4284,5073,5379,6279,6629,7675,8073,9246,9694,

%U 11000,11500,12945,13499,15089,15699,17479,18149,20131,20865,23018,23818,26148,27016

%N a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 18 23:41 EDT 2021. Contains 344009 sequences. (Running on oeis4.)