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.

Previous Showing 11-13 of 13 results.

A167560 The ED2 array read by ascending antidiagonals.

Original entry on oeis.org

1, 2, 1, 6, 4, 1, 24, 16, 6, 1, 120, 80, 32, 8, 1, 720, 480, 192, 54, 10, 1, 5040, 3360, 1344, 384, 82, 12, 1, 40320, 26880, 10752, 3072, 680, 116, 14, 1, 362880, 241920, 96768, 27648, 6144, 1104, 156, 16, 1
Offset: 1

Views

Author

Johannes W. Meijer, Nov 10 2009

Keywords

Comments

The coefficients in the upper right triangle of the ED2 array (m>n) were found with the a(n,m) formula while the coefficients in the lower left triangle of the ED2 array (m<=n) were found with the recurrence relation, see below. We use for the array rows the letter n (>=1) and for the array columns the letter m (>=1).
The ED2 array is related to the EG1 matrix, see A162005, because sum(EG1(2*m-1,n) * z^(2*m-1), m=1..infinity) = ((2*n-1)!/(4^(n-1)*(n-1)!^2))*int(sinh(y*(2*z))/cosh(y)^(2*n), y=0..infinity).
For the ED1, ED3 and ED4 arrays see A167546, A167572 and A167584.

Examples

			The ED2 array begins with:
1, 1, 1, 1, 1, 1, 1, 1, 1, 1
2, 4, 6, 8, 10, 12, 14, 16, 18, 20
6, 16, 32, 54, 82, 116, 156, 202, 254, 312
24, 80, 192, 384, 680, 1104, 1680, 2432, 3384, 4560
120, 480, 1344, 3072, 6144, 11160, 18840, 30024, 45672, 66864
720, 3360, 10752, 27648, 61440, 122880, 226800, 392832, 646128, 1018080

Links

Crossrefs

A000012, A005843 (n>=1), 2*A104249 (n>=1), A167561, A167562 and A167563 equal the first sixth rows of the array.
A000142 equals the first column of the array.
A047053 equals the a(n, n) diagonal of the array.
2*A034177 equals the a(n+1, n) diagonal of the array.
A167570 equals the a(n+2, n) diagonal of the array,
A167564 equals the row sums of the ED2 array read by antidiagonals.
A167565 is a triangle related to the a(n) formulas of the rows of the ED2 array.
A167568 is a triangle related to the GF(z) formulas of the rows of the ED2 array.
A167569 is the lower left triangle of the ED2 array.
Cf. A162005 (EG1 triangle).
Cf. A167546 (ED1 array), A167572 (ED3 array), A167584 (ED4 array).

Programs

  • Maple
    nmax:=10; mmax:=10; for n from 1 to nmax do for m from 1 to n do a(n,m) := 4^(m-1)*(m-1)!*(n+m-1)!/(2*m-1)! od; for m from n+1 to mmax do a(n,m):= n! + sum((-1)^(k-1)*binomial(n-1,k)*a(n,m-k),k=1..n-1) od; od: for n from 1 to nmax do for m from 1 to n do d(n,m):=a(n-m+1,m) od: od: T:=1: for n from 1 to nmax do for m from 1 to n do a(T):= d(n,m): T:=T+1: od: od: seq(a(n),n=1..T-1);
# alternative
A167560 := proc(n,m)
    option remember ;
    if m > n then
        n!+add( (-1)^(k-1)*binomial(n-1,k)*procname(n,m-k),k=1..n-1) ;
    else
        4^(m-1)*(m-1)!*(n+m-1)!/(2*m-1)! ;
    end if;
end proc:
seq( seq(A167560(d-m,m),m=1..d-1),d=2..12) ; # R. J. Mathar, Jun 28 2024
  • Mathematica
    nmax = 10; mmax = 10; For[n = 1, n <= nmax, n++, For[m = 1, m <= n, m++, a[n, m] = 4^(m - 1)*(m - 1)!*((n + m - 1)!/(2*m - 1)!)]; For[m = n + 1, m <= mmax, m++, a[n, m] = n! + Sum[(-1)^(k - 1)*Binomial[n - 1, k]*a[n, m - k], {k, 1, n - 1}]]; ]; For[n = 1, n <= nmax, n++, For[m = 1, m <= n, m++, d[n, m] = a[n - m + 1, m]]; ]; t = 1; For[n = 1, n <= nmax, n++, For[m = 1, m <= n, m++, a[t] = d[n, m]; t = t + 1]]; Table[a[n], {n, 1, t - 1}] (* Jean-François Alcover, Dec 20 2011, translated from Maple *)

Formula

a(n,m) = ((m-1)!/((m-n-1)!))*int(sinh(y*(2*n))/(cosh(y))^(2*m),y=0..infinity) for m>n.
The (n-1)-differences of the n-th array row lead to the recurrence relation
sum((-1)^k*binomial(n-1,k)*a(n-1,m-k),k=0..n-1) = n!
which in its turn leads to, see A167569,
a(n,m) = 4^(m-1)*(m-1)!*(n+m-1)!/(2*m-1)! if m<=n.

A167572 The ED3 array read by antidiagonals.

Original entry on oeis.org

1, 5, 1, 23, 11, 1, 167, 83, 17, 1, 1473, 741, 183, 23, 1, 16413, 8169, 2043, 323, 29, 1, 211479, 106107, 26529, 4409, 503, 35, 1, 3192975, 1592235, 398025, 66345, 8175, 723, 41, 1, 54010305, 27062325, 6765975, 1127655, 140865, 13677, 983, 47, 1
Offset: 1

Views

Author

Johannes W. Meijer, Nov 10 2009

Keywords

Comments

The coefficients in the upper right triangle of the ED3 array (m>n) were found with the a(n,m) formula while the coefficients in the lower left triangle of the ED3 array (m<=n) were found with the recurrence relation, see below. We use for the array rows the letter n (>=1) and for the array columns the letter m (>=1).
For the ED1, ED2 and ED4 arrays see A167546, A167560 and A167584.

Examples

			The ED3 array begins with:
1, 1, 1, 1, 1, 1, 1, 1, 1, 1
5, 11, 17, 23, 29, 35, 41, 47, 53, 59
23, 83, 183, 323, 503, 723, 983, 1283, 1623, 2003
167, 741, 2043, 4409, 8175, 13677, 21251, 31233, 43959, 59765
1473, 8169, 26529, 66345, 140865, 266793, 464289, 756969, 1171905, 1739625
16413, 106107, 398025, 1127655, 2678325, 5623443, 10768737, 19194495, 32297805, 51834795

Links

  • Johannes W. Meijer, The four Escher-Droste arrays, jpg image, Mar 08 2013.

Crossrefs

A000012, A016969, A167573, A167574 and A167575 equal the first five rows of the array.
A167576, A167577 and A167578 equal the first three columns of the array.
A167579 equals the row sums of the ED3 array read by antidiagonals.
A167580 is a triangle related to the a(n) formulas of the rows of the ED3 array.
A167583 is a triangle related to the GF(z) formulas of the rows of the ED3 array.
Cf. A014481 (the 2^(n-1)*(n-1)!*(2*n-1) factor).
Cf. A167546 (ED1 array), A167560 (ED2 array), A167584 (ED4 array).

Formula

a(n,m) = ((2*m-1)!!/ (2*m-2*n-1)!!)*int(sinh(y*(2*n-1))/(cosh(y))^(2*m),y=0..infinity) for m>n.
The (n-1)-differences of the n-th array row lead to the recurrence relation
sum((-1)^k*binomial(n-1,k)*a(n,m-k),k=0..n-1) = 2^(n-1)*(n-1)!*(2*n-1).

A167585 a(n) = 12*n^2 - 8*n + 9.

Original entry on oeis.org

13, 41, 93, 169, 269, 393, 541, 713, 909, 1129, 1373, 1641, 1933, 2249, 2589, 2953, 3341, 3753, 4189, 4649, 5133, 5641, 6173, 6729, 7309, 7913, 8541, 9193, 9869, 10569, 11293, 12041, 12813, 13609, 14429, 15273, 16141, 17033, 17949, 18889
Offset: 1

Views

Author

Johannes W. Meijer, Nov 10 2009

Keywords

Comments

The third row of the ED4 array A167584.

Links

Programs

Formula

GF(z) = (9*z^2 + 2*z + 13)/(1-z)^3.
a(n) = a(n-1) + 24*n - 20, with a(1)=13. - Vincenzo Librandi, Dec 03 2010
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - G. C. Greubel, Jun 17 2016
Previous Showing 11-13 of 13 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.