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

A384365 a(n) = Sum_{k=0..n} (k+1) * 3^k * binomial(2*n+1,n-k).

Original entry on oeis.org

1, 9, 67, 458, 2979, 18750, 115278, 696372, 4149283, 24452534, 142808922, 827780684, 4767638158, 27309438252, 155689424316, 883891633896, 4999703023395, 28188457323366, 158463492162594, 888473780483292, 4969653746436762, 27737520941131140, 154507945286680452
Offset: 0

Views

Author

Seiichi Manyama, Aug 11 2025

Keywords

Crossrefs

Programs

  • Magma
    [&+[ (k+1) * 3^k * Binomial(2*n+1,n-k): k in [0..n]]: n in [0..25]]; // Vincenzo Librandi, Sep 03 2025
  • Mathematica
    Table[Sum[(k+1) * 3^k*Binomial[2*n+1,n-k],{k,0,n}],{n,0,30}] (* Vincenzo Librandi, Sep 03 2025 *)
  • PARI
    a(n) = sum(k=0, n, (k+1)*3^k*binomial(2*n+1, n-k));
    

Formula

a(n) = [x^n] 1/((1-4*x)^2 * (1-x)^n).
a(n) = Sum_{k=0..n} 4^k * (-3)^(n-k) * binomial(2*n+1,k) * binomial(2*n-k-1,n-k).
a(n) = Sum_{k=0..n} (k+1) * 4^k * binomial(2*n-k-1,n-k).
G.f.: (1+sqrt(1-4*x))/( 2 * sqrt(1-4*x) * (2*sqrt(1-4*x)-1)^2 ).
D-finite with recurrence +27*n*a(n) +6*(-58*n+17)*a(n-1) +32*(46*n-37)*a(n-2) +1024*(-2*n+3)*a(n-3)=0. - R. J. Mathar, Aug 19 2025
a(n) ~ n * 2^(4*n+1) / 3^(n+1). - Vaclav Kotesovec, Aug 20 2025

A386956 a(n) = Sum_{k=0..n} (k+1) * 8^k * binomial(2*n+1,n-k).

Original entry on oeis.org

1, 19, 282, 3763, 47294, 571950, 6733668, 77723187, 883589238, 9924844474, 110396411372, 1218075749934, 13348677037868, 145438914042172, 1576690043132376, 17018212213758771, 182983432175308710, 1960781840268630786, 20947171352106580284, 223169444039365834362
Offset: 0

Views

Author

Seiichi Manyama, Aug 11 2025

Keywords

Crossrefs

Programs

  • Magma
    [&+[(k+1) * 8^k * Binomial(2*n+1,n-k): k in [0..n]]: n in [0..25]]; // Vincenzo Librandi, Sep 03 2025
  • Mathematica
    Table[Sum[(k+1) * 8^k*Binomial[2*n+1,n-k],{k,0,n}],{n,0,30}] (* Vincenzo Librandi, Sep 03 2025 *)
  • PARI
    a(n) = sum(k=0, n, (k+1)*8^k*binomial(2*n+1, n-k));
    

Formula

a(n) = [x^n] 1/((1-9*x)^2 * (1-x)^n).
a(n) = Sum_{k=0..n} 9^k * (-8)^(n-k) * binomial(2*n+1,k) * binomial(2*n-k-1,n-k).
a(n) = Sum_{k=0..n} (k+1) * 9^k * binomial(2*n-k-1,n-k).
G.f.: 2 * (1+sqrt(1-4*x))/( sqrt(1-4*x) * (9*sqrt(1-4*x)-7)^2 ).
Showing 1-2 of 2 results.