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

A369836 Number of compositions of 5*n into parts 1 and 5.

Original entry on oeis.org

1, 2, 8, 34, 140, 571, 2328, 9496, 38740, 158045, 644761, 2630364, 10730820, 43777405, 178594110, 728591751, 2972359720, 12126025705, 49469281395, 201814663875, 823322219501, 3358821723401, 13702634402876, 55901207340276, 228054320813276, 930369409108152
Offset: 0

Views

Author

Seiichi Manyama, Feb 03 2024

Keywords

Links

Crossrefs

Cf. A079675, A369837, A369838, A369839.
Cf. A099131, A369840, A369845.
Cf. A003520.

Programs

  • Mathematica
    LinearRecurrence[{6, -10, 10, -5, 1}, {1, 2, 8, 34, 140}, 50] (* Paolo Xausa, Mar 15 2024 *)
  • PARI
    a(n) = sum(k=0, n, binomial(n+4*k, n-k));

Formula

a(n) = A003520(5*n).
a(n) = Sum_{k=0..n} binomial(n+4*k,n-k).
a(n) = 6*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5).
G.f.: (1-x)^4/((1-x)^5 - x).

A369803 Expansion of 1/(1 - x^2/(1-x)^5).

Original entry on oeis.org

1, 0, 1, 5, 16, 45, 126, 361, 1046, 3032, 8771, 25348, 73252, 211724, 612009, 1769080, 5113647, 14781237, 42725841, 123501151, 356986401, 1031887518, 2982723523, 8621714049, 24921502864, 72036871920, 208226244217, 601888555723, 1739789499591, 5028950081882
Offset: 0

Views

Author

Seiichi Manyama, Feb 01 2024

Keywords

Comments

Number of compositions of 5*n-2 into parts 2 and 5.

Links

Crossrefs

Cf. A079675, A368475, A369804.
Cf. A369840, A369842, A369843, A369844.
Cf. A001687.

Programs

  • PARI
    my(N=30, x='x+O('x^N)); Vec(1/(1-x^2/(1-x)^5))
  • PARI
    a(n) = sum(k=0, n\2, binomial(n-1+3*k, n-2*k));

Formula

a(n) = A001687(5*n-1) for n > 0.
a(n) = 5*a(n-1) - 9*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) for n > 5.
a(n) = Sum_{k=0..floor(n/2)} binomial(n-1+3*k,n-2*k).
a(n) = A369840(n)-A369840(n-1). - R. J. Mathar, Feb 14 2024

A373908 Number of compositions of 7*n into parts 2 and 7.

Original entry on oeis.org

1, 1, 2, 9, 38, 136, 452, 1495, 5031, 17114, 58282, 198032, 671856, 2278870, 7731892, 26238839, 89047335, 302191369, 1025487338, 3479970844, 11809261583, 40074827170, 135994407483, 461498426696, 1566098800484, 5314568565096, 18035031128780, 61202027710656
Offset: 0

Views

Author

Seiichi Manyama, Jun 22 2024

Keywords

Links

Crossrefs

Cf. A373907, A373909, A373910, A373911, A373912.
Cf. A109961, A369840, A373904.
Cf. A369813.

Programs

  • PARI
    a(n) = sum(k=0, n\2, binomial(n+5*k, n-2*k));

Formula

a(n) = A369813(7*n).
a(n) = Sum_{k=0..floor(n/2)} binomial(n+5*k,n-2*k).
a(n) = 7*a(n-1) - 20*a(n-2) + 35*a(n-3) - 35*a(n-4) + 21*a(n-5) - 7*a(n-6) + a(n-7).
G.f.: 1/(1 - x - x^2/(1 - x)^6).

A369842 Number of compositions of 5*n-1 into parts 2 and 5.

Original entry on oeis.org

1, 3, 7, 18, 52, 154, 450, 1301, 3753, 10838, 31327, 90568, 261813, 756786, 2187496, 6323023, 18277014, 52830706, 152709940, 441415867, 1275934888, 3688154521, 10660798289, 30815580241, 89074003241, 257472939209, 744238632362, 2151259638423, 6218325456983
Offset: 1

Views

Author

Seiichi Manyama, Feb 03 2024

Keywords

Links

Crossrefs

Cf. A369803, A369840, A369843, A369844.
Cf. A001687.

Programs

  • Mathematica
    LinearRecurrence[{5, -9, 10, -5, 1}, {1, 3, 7, 18, 52}, 50] (* Paolo Xausa, Mar 15 2024 *)
  • PARI
    a(n) = sum(k=0, n\2, binomial(n+1+3*k, n-1-2*k));

Formula

a(n) = A001687(5*n).
a(n) = Sum_{k=0..floor(n/2)} binomial(n+1+3*k,n-1-2*k).
a(n) = 5*a(n-1) - 9*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5).
G.f.: x*(1-x)^2/((1-x)^5 - x^2).

A369843 Number of compositions of 5*n-3 into parts 2 and 5.

Original entry on oeis.org

1, 2, 4, 11, 34, 102, 296, 851, 2452, 7085, 20489, 59241, 171245, 494973, 1430710, 4135527, 11953991, 34553692, 99879234, 288705927, 834519021, 2412219633, 6972643768, 20154781952, 58258423000, 168398935968, 486765693153, 1407021006061, 4067065818560
Offset: 1

Views

Author

Seiichi Manyama, Feb 03 2024

Keywords

Links

Crossrefs

Cf. A369803, A369840, A369842, A369844.
Cf. A001687.

Programs

  • Mathematica
    LinearRecurrence[{5, -9, 10, -5, 1}, {1, 2, 4, 11, 34}, 50] (* Paolo Xausa, Mar 15 2024 *)
  • PARI
    a(n) = sum(k=0, n\2, binomial(n+3*k, n-1-2*k));

Formula

a(n) = A001687(5*n-2).
a(n) = Sum_{k=0..floor(n/2)} binomial(n+3*k,n-1-2*k).
a(n) = 5*a(n-1) - 9*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5).
G.f.: x*(1-x)^3/((1-x)^5 - x^2).

A369844 Number of compositions of 5*n-4 into parts 2 and 5.

Original entry on oeis.org

0, 1, 4, 11, 29, 81, 235, 685, 1986, 5739, 16577, 47904, 138472, 400285, 1157071, 3344567, 9667590, 27944604, 80775310, 233485250, 674901117, 1950836005, 5638990526, 16299788815, 47115369056, 136189372297, 393662311506, 1137900943868, 3289160582291, 9507486039274
Offset: 1

Views

Author

Seiichi Manyama, Feb 03 2024

Keywords

Links

Crossrefs

Cf. A369803, A369840, A369842, A369843.
Cf. A001687.

Programs

  • Mathematica
    LinearRecurrence[{5, -9, 10, -5, 1}, {0, 1, 4, 11, 29}, 50] (* Paolo Xausa, Mar 15 2024 *)
  • PARI
    a(n) = sum(k=0, n\2, binomial(n+1+3*k, n-2-2*k));

Formula

a(n) = A001687(5*n-3).
a(n) = Sum_{k=0..floor(n/2)} binomial(n+1+3*k,n-2-2*k).
a(n) = 5*a(n-1) - 9*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5).
G.f.: x^2*(1-x)/((1-x)^5 - x^2).

A373904 a(n) = Sum_{k=0..floor(n/2)} binomial(n+4*k,n-2*k).

Original entry on oeis.org

1, 1, 2, 8, 30, 98, 303, 937, 2936, 9260, 29209, 91999, 289547, 911255, 2868341, 9029425, 28424456, 89478064, 281667368, 886657848, 2791106585, 8786123349, 27657838272, 87064092870, 274068969337, 862741412709, 2715822822365, 8549136056237, 26911817257385
Offset: 0

Views

Author

Seiichi Manyama, Jun 22 2024

Keywords

Links

Crossrefs

Cf. A011782, A034943, A109961, A369840, A373908.
Cf. A107025, A371125, A373905, A373906.

Programs

  • PARI
    a(n) = sum(k=0, n\2, binomial(n+4*k,n-2*k));

Formula

a(n) = 6*a(n-1) - 14*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6).
G.f.: 1/(1 - x - x^2/(1 - x)^5).
Showing 1-7 of 7 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.