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!)
A024376 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = A014306. 0

%I

%S 0,1,1,0,2,1,2,3,3,2,4,3,4,5,5,5,5,6,6,6,8,7,8,9,9,9,9,10,10,10,11,11,

%T 13,12,12,13,13,13,15,14,15,15,17,16,17,17,18,19,19,19,20,20,20,21,21,

%U 20,22,21,22,23,24,23,24,25,25,25,26,26,28,27,28,28,29,29,31,30,31,31,32,32,33,34,34,33

%N a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = A014306.

%K nonn

%O 1,5

%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 March 28 20:44 EDT 2020. Contains 333103 sequences. (Running on oeis4.)