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

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

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

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

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

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

%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 April 19 02:28 EDT 2024. Contains 371782 sequences. (Running on oeis4.)