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

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

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

%T 12,11,12,12,12,12,14,14,14,14,16,14,16,16,16,18,17,17,18,19,19,19,20,

%U 19,21,21,21,21,23,23,24,23,23,24,25,24,26,26,26,26,29,27,28,28,28,31,29,30,31,30,31

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

%K nonn

%O 1,6

%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 August 11 05:23 EDT 2024. Contains 375059 sequences. (Running on oeis4.)