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

%I

%S 2,3,11,17,40,56,111,147,254,308,515,621,944,1094,1599,1849,2548,2884,

%T 3851,4243,5588,6170,7841,8493,10672,11496,14179,15281,18448,19780,

%U 23541,25037,29574,31228,36649,38765,44888,47234,54365,57087,65230,68552,77593,81245

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

%K nonn

%O 1,1

%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 October 2 01:30 EDT 2022. Contains 357191 sequences. (Running on oeis4.)