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!)
A030037 a(n+1) = Sum_{k=0..floor(2*n/5)} a(k) * a(n-k). 5

%I #11 Oct 15 2021 14:59:26

%S 1,1,1,1,2,3,6,11,20,40,77,160,319,636,1332,2721,5799,12068,25109,

%T 53943,113682,245931,523896,1115239,2425858,5208339,11388934,24630843,

%U 53194684,116764483,253764437,559289434,1221970242,2666776056,5889628123,12910470041,28608337855

%N a(n+1) = Sum_{k=0..floor(2*n/5)} a(k) * a(n-k).

%H Seiichi Manyama, <a href="/A030037/b030037.txt">Table of n, a(n) for n = 0..1000</a>

%o (PARI) lista(nn) = {my(v=vector(nn+2, i, 1)); for(n=2, nn, v[n+2]=sum(k=1, 1+(2*n)\5, v[k]*v[n+2-k])); v; } \\ _Jinyuan Wang_, Mar 18 2020

%Y Cf. A000992, A030036, A030038, A030039.

%K nonn

%O 0,5

%A _N. J. A. Sloane_

%E More terms from _Jinyuan Wang_, Mar 18 2020

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 July 9 20:10 EDT 2024. Contains 374191 sequences. (Running on oeis4.)