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

%I #12 Oct 15 2021 21:29:53

%S 1,1,1,2,3,6,13,26,57,117,262,602,1329,3079,6903,16161,38185,87745,

%T 207896,481817,1148246,2755781,6485489,15592656,36899080,88966356,

%U 215687474,515590781,1251629165,2998835401,7291353036,17803231663,42980538045,104981503048,253813177447

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

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

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

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

%K nonn

%O 0,4

%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 April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)