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

%I #3 Mar 30 2012 18:56:00

%S 0,0,0,0,1,0,0,0,1,0,0,1,0,1,0,0,1,0,0,1,1,0,1,0,0,0,2,0,0,1,0,1,0,1,

%T 1,0,0,1,1,0,0,1,0,1,1,0,2,0,0,0,1,0,1,1,0,1,1,0,0,1,1,1,0,0,1,1,0,1,

%U 1,0,0,2,0,0,0,0,3,0,1,1,0,0,1,1,0,0,1,0,1,2,0,0,1,0,1,1,1,1,0,0,0,2,0,1,0,0,2,1,0,1,1

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

%K nonn

%O 2,27

%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 March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)