cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

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

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 3, 5, 8, 13, 26, 47, 86, 159, 292, 584, 1121, 2156, 4153, 8014, 16028, 31472, 61823, 121490, 238827, 477654, 947294, 1878560, 3725648, 7389473, 14900436, 29796719, 59593438, 119178862, 238341696, 482287600, 970054641, 1951222247, 3924973230
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

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

Extensions

More terms from Jinyuan Wang, Mar 18 2020

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

Original entry on oeis.org

1, 1, 1, 2, 3, 6, 13, 26, 57, 117, 262, 602, 1329, 3079, 6903, 16161, 38185, 87745, 207896, 481817, 1148246, 2755781, 6485489, 15592656, 36899080, 88966356, 215687474, 515590781, 1251629165, 2998835401, 7291353036, 17803231663, 42980538045, 104981503048, 253813177447
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

  • 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

Extensions

More terms from Jinyuan Wang, Mar 18 2020

A030039 a(n+1) = Sum_{k=0..floor(4*n/5)} a(k) * a(n-k).

Original entry on oeis.org

1, 1, 1, 2, 4, 9, 21, 42, 97, 233, 570, 1414, 3319, 8208, 20595, 52370, 133955, 328261, 833652, 2136155, 5519116, 14341917, 36069212, 93074465, 241613666, 630653714, 1652472131, 4215072482, 10985970447, 28756470626, 75580683613, 199201407564, 513021407584
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

  • PARI
    lista(nn) = {my(v=vector(nn+2, i, 1)); for(n=1, nn, v[n+2]=sum(k=1, 1+(4*n)\5, v[k]*v[n+2-k])); v; } \\ Jinyuan Wang, Mar 18 2020

Extensions

More terms from Jinyuan Wang, Mar 18 2020

A030033 a(n+1) = Sum_{k = 0..floor(2*n/3)} a(k)*a(n-k) for n >= 0 with a(0) = 1.

Original entry on oeis.org

1, 1, 1, 2, 4, 7, 15, 34, 72, 165, 387, 861, 2039, 4894, 11256, 27085, 66021, 156347, 381720, 940211, 2261208, 5578659, 13846756, 33654950, 83539418, 208608556, 512069441, 1278522424, 3207377196, 7925966000
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

  • Maple
    a := proc(n) local k; option remember;
         if n = 0 then 1;
         else add(a(k)*a(n - 1 - k), k = 0 .. floor(2/3*n - 2/3));
         end if;
    end proc;
    seq(a(n), n = 0..30); # Petros Hadjicostas, Nov 07 2019

Extensions

Name edited by Petros Hadjicostas, Nov 07 2019
Showing 1-4 of 4 results.