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

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

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

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

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

%N a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023532, t = 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 25 05:56 EDT 2024. Contains 371964 sequences. (Running on oeis4.)