[go: up one dir, main page]

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

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

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

%T 11,11,12,11,12,14,14,13,14,15,14,15,16,15,18,16,17,17,19,19,19,19,19,

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

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

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 31 08:34 EDT 2024. Contains 375560 sequences. (Running on oeis4.)