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-5 of 5 results.

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

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 6, 11, 20, 40, 77, 160, 319, 636, 1332, 2721, 5799, 12068, 25109, 53943, 113682, 245931, 523896, 1115239, 2425858, 5208339, 11388934, 24630843, 53194684, 116764483, 253764437, 559289434, 1221970242, 2666776056, 5889628123, 12910470041, 28608337855
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

  • 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

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

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

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 5, 10, 18, 33, 66, 127, 244, 506, 1009, 2018, 4229, 8631, 17631, 37265, 77349, 160433, 342807, 720334, 1513791, 3254445, 6902283, 14634519, 31602375, 67522598, 144182089, 312851626, 672411931, 1444776938, 3145883976, 6794243911, 14667444523
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\3, v[k]*v[n+2-k])); v; } \\ Jinyuan Wang, Mar 18 2020

Extensions

More terms from Jinyuan Wang, Mar 18 2020

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

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 3, 5, 8, 16, 29, 53, 98, 196, 376, 723, 1393, 2786, 5474, 10752, 21128, 42979, 85905, 171810, 343522, 703270, 1421998, 2875847, 5817194, 11978061, 24428369, 49817625, 101588512, 209911975, 430722621, 883632025, 1812556425, 3763773324, 7764267706
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\4, 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
Showing 1-5 of 5 results.