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

A336573 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = (-1)^n * Sum_{j=0..n} (-2)^j * binomial(n,j) * binomial(k*n+j+1,n)/(k*n+j+1).

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 3, 4, 1, 1, 4, 11, 8, 1, 1, 5, 21, 45, 16, 1, 1, 6, 34, 126, 197, 32, 1, 1, 7, 50, 267, 818, 903, 64, 1, 1, 8, 69, 484, 2279, 5594, 4279, 128, 1, 1, 9, 91, 793, 5105, 20540, 39693, 20793, 256, 1, 1, 10, 116, 1210, 9946, 56928, 192350, 289510, 103049, 512
Offset: 0

Views

Author

Seiichi Manyama, Jul 26 2020

Keywords

Comments

T(n,k) is the number of Sylvester classes of k-packed words of degree n.

Examples

			Square array begins:
   1,   1,   1,    1,    1,    1, ...
   1,   1,   1,    1,    1,    1, ...
   2,   3,   4,    5,    6,    7, ...
   4,  11,  21,   34,   50,   69, ...
   8,  45, 126,  267,  484,  793, ...
  16, 197, 818, 2279, 5105, 9946, ...

Links

Crossrefs

Columns k = 0-5 are: A011782, A001003, A003168, A243659, A243667, A243668.
Main diagonal is A336495.
Cf. A336534, A336574, A336575.

Programs

  • Maple
    T := (n,k) -> `if`(k=0, `if`(n=0, 1, 2^(n-1)), (-1)^n*(binomial(k*n+1, n)* hypergeom([-n, k*n+1], [(k-1)*n+2], 2)) / (k*n+1)):
seq(lprint(seq(simplify(T(n, k)), k=0..9)), n=0..6); # Peter Luschny, Jul 26 2020
  • Mathematica
    T[n_, k_] := (-1)^n * Sum[(-2)^j * Binomial[n, j] * Binomial[k*n+j+1, n]/(k*n+j+1), {j, 0, n}]; Table[T[k, n-k], {n, 0, 10}, {k, 0, n}] // Flatten (* Amiram Eldar, May 01 2021 *)
  • PARI
    T(n, k) = (-1)^n*sum(j=0, n, (-2)^j*binomial(n, j)*binomial(k*n+j+1, n)/(k*n+j+1));
  • PARI
    T(n, k) = my(A=1+x*O(x^n)); for(i=0, n, A=1-x*A^k*(1-2*A)); polcoeff(A, n);
  • PARI
    T(n, k) = (-1)^n*sum(j=0, n, (-2)^(n-j)*binomial(k*n+1, j)*binomial((k+1)*n-j, n-j))/(k*n+1);

Formula

G.f. A_k(x) of column k satisfies A_k(x) = 1 - x * A_k(x)^k * (1 - 2 * A_k(x)).
T(n,k) = ( (-1)^n / (k*n+1) ) * Sum_{j=0..n} (-2)^(n-j) * binomial(k*n+1,j) * binomial((k+1)*n-j,n-j).
T(n,k) = (-1)^n*binomial(k*n+1, n)*hypergeom([-n, k*n+1], [(k-1)*n+2], 2)/(k*n+1) for k >= 1. - Peter Luschny, Jul 26 2020
T(n,k) = (1/n) * Sum_{j=0..n-1} binomial(n,j) * binomial((k+1)*n-j,n-1-j) for n > 0. - Seiichi Manyama, Aug 08 2023

A336578 a(0) = 1 and a(n) = (1/n) * Sum_{k=1..n} 3^k * binomial(n,k) * binomial(n^2,k-1) for n > 0.

Original entry on oeis.org

1, 3, 21, 408, 14799, 817743, 61621806, 5921141502, 694008501627, 96176405390961, 15400332946269903, 2799678523675400832, 569877183695866859625, 128436925725088289658534, 31756620986815666396814796, 8548059658831271609064999978, 2488568825786280454788465874035, 779186768737628124697943895022101
Offset: 0

Views

Author

Seiichi Manyama, Jul 26 2020

Keywords

Links

Crossrefs

Main diagonal of A336575.
Cf. A336495, A336537, A336577.

Programs

  • Mathematica
    a[0] := 1; a[n_] := Sum[3^k * Binomial[n, k] * Binomial[n^2, k - 1], {k, 1, n}]/n;  Array[a, 18, 0] (* Amiram Eldar, Jul 27 2020 *)
  • PARI
    a(n) = if(n==0, 1, sum(k=1, n, 3^k*binomial(n, k)*binomial(n^2, k-1))/n);
  • PARI
    a(n) = sum(k=0, n, 2^(n-k)*binomial(n, k)*binomial(n^2+k+1, n)/(n^2+k+1)); \\ Seiichi Manyama, Jul 27 2020
  • PARI
    a(n) = sum(k=0, n, 2^k*binomial(n^2+1, k)*binomial((n+1)*n-k, n-k))/(n^2+1); \\ Seiichi Manyama, Jul 27 2020

Formula

a(n) = Sum_{k=0..n} 2^(n-k) * binomial(n,k) * binomial(n^2+k+1,n)/(n^2+k+1).
a(n) = (1/(n^2+1)) * Sum_{k=0..n} 2^k * binomial(n^2+1,k) * binomial((n+1)*n-k,n-k).
a(n) ~ 3^n * exp(n - 1/6) * n^(n - 5/2) / sqrt(2*Pi). - Vaclav Kotesovec, Jul 31 2021
a(n) = (1/n) * Sum_{k=0..n-1} (-2)^k * 3^(n-k) * binomial(n,k) * binomial((n+1)*n-k,n-1-k) for n > 0. - Seiichi Manyama, Aug 10 2023
a(n) = 3*hypergeom([1-n, -n^2], [2], 3) for n > 0. - Stefano Spezia, Aug 09 2025

A336577 a(n) = Sum_{k=0..n} 2^k * binomial(n,k) * binomial(n^2+k+1,n)/(n^2+k+1).

Original entry on oeis.org

1, 3, 24, 498, 18708, 1055838, 80682414, 7829287392, 924359573112, 128815914107370, 20717986773639696, 3779867347688995698, 771666206195918154156, 174345811623642373266360, 43198501381068549879753648, 11648965476456962547182140512, 3396661425137920919866033312752
Offset: 0

Views

Author

Seiichi Manyama, Jul 26 2020

Keywords

Links

Crossrefs

Main diagonal of A336574.
Cf. A336495, A336537, A336578.

Programs

  • Mathematica
    a[n_] := Sum[2^k * Binomial[n, k] * Binomial[n^2 + k + 1, n]/(n^2 + k + 1), {k, 0, n}];  Array[a, 17, 0] (* Amiram Eldar, Jul 27 2020 *)
  • PARI
    a(n) = sum(k=0, n, 2^k*binomial(n, k)*binomial(n^2+k+1, n)/(n^2+k+1));
  • PARI
    a(n) = sum(k=0, n, 2^(n-k)*binomial(n^2+1, k)*binomial((n+1)*n-k, n-k))/(n^2+1);

Formula

a(n) = (1/(n^2+1)) * Sum_{k=0..n} 2^(n-k) * binomial(n^2+1,k) * binomial((n+1)*n-k,n-k).
a(n) ~ 3^n * exp(n + 1/6) * n^(n - 5/2) / sqrt(2*Pi). - Vaclav Kotesovec, Jul 31 2021
From Seiichi Manyama, Aug 10 2023: (Start)
a(n) = (1/n) * Sum_{k=0..n-1} (-1)^k * 3^(n-k) * binomial(n,k) * binomial((n+1)*n-k,n-1-k) for n > 0.
a(n) = (1/n) * Sum_{k=1..n} 3^k * 2^(n-k) * binomial(n,k) * binomial(n^2,k-1) for n > 0. (End)
a(n) = binomial(1+n^2, n)*hypergeom([-n, 1+n^2], [2-n+n^2], -2)/(1 + n^2). - Stefano Spezia, Aug 09 2025
Showing 1-3 of 3 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.