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.

A342467 a(n) is the number of n-th order magic triangles.

Original entry on oeis.org

0, 4, 18, 700, 13123, 316424, 7317145, 176476738, 4279366371
Offset: 2

Views

Author

Stefano Spezia, Mar 13 2021

Keywords

Comments

The Trotter reference gives the value 1356 = 76 * 18 for a(5), which is incorrect since 76 is the number of corner groupings and 18 is the maximum number of solutions in any grouping. - Andrew Howroyd, Feb 05 2022

Crossrefs

Programs

  • PARI
    \\ See Links.

Formula

a(n) < A351223(n). - Stefano Spezia, Feb 05 2022

Extensions

a(5) corrected by Andrew Howroyd and Stefano Spezia, Feb 05 2022
a(6)-a(10) from Andrew Howroyd, Feb 05 2022

A342758 Array read by ascending antidiagonals: T(k, n) is the maximum value of the magic constant in a perimeter-magic k-gon of order n.

Original entry on oeis.org

12, 15, 23, 19, 30, 37, 22, 37, 48, 54, 26, 44, 60, 71, 74, 29, 51, 71, 88, 97, 97, 33, 58, 83, 105, 121, 128, 123, 36, 65, 94, 122, 144, 159, 162, 152, 40, 72, 106, 139, 168, 190, 202, 201, 184, 43, 79, 117, 156, 191, 221, 241, 250, 243, 219, 47, 86, 129, 173, 215, 252, 281, 299, 303, 290, 257
Offset: 3

Views

Author

Stefano Spezia, Mar 21 2021

Keywords

Examples

			The array begins:
k\n|  3   4   5    6    7 ...
---+---------------------
3  | 12  23  37   54   74 ...
4  | 15  30  48   71   97 ...
5  | 19  37  60   88  121 ...
6  | 22  44  71  105  144 ...
7  | 26  51  83  122  168 ...
...
		

Crossrefs

Cf. A017005 (n = 4), A135503 (diagonal), A341740 (k = 3), A342719, A342757 (minimum).

Programs

  • Mathematica
    T[k_,n_]:= (n+k(n^2-2)+(Mod[k,2]-1)Mod[n,2])/2; Table[T[k+3-n,n],{k,3,13},{n,3,k}]//Flatten

Formula

G.f.: (- x^2*(2*y^2 + y - 1) - x*(y^2 + 2*y - 1) + (y - 1)*y^2)/((x - 1)^2*(x + 1)*(y - 1)^3*(y + 1)).
T(k, n) = (n^2/2 - 1)*k + n/2 if n is even or both n and k are odd.
T(k, n) = (n^2/2 - 1)*k + (n - 1)/2 if n is odd and k is even.
T(k, n) = (n + k*(n^2 - 2) + ((k mod 2) - 1)*(n mod 2))/2.

A342384 Irregular triangle T read by rows: T(n, k) is the number of n-th order magic triangles with magic constant equal to A285009(n) + k, with 0 < k <= 3*n - 5.

Original entry on oeis.org

0, 1, 1, 1, 1, 2, 0, 4, 6, 4, 0, 2, 18, 38, 71, 108, 115, 115, 108, 71, 38, 18, 155, 351, 695, 1067, 1475, 1815, 2007, 1815, 1475, 1067, 695, 351, 155, 1891, 4768, 9872, 15370, 22527, 30096, 35731, 37957, 37957, 35731, 30096, 22527, 15370, 9872, 4768, 1891
Offset: 2

Views

Author

Stefano Spezia, Mar 10 2021

Keywords

Examples

			The triangle begins:
    0;
    1,   1,   1,    1;
    2,   0,   4,    6,    4,    0,    2;
   18,  38,  71,  108,  115,  115,  108,   71,   38,   18;
  155, 351, 695, 1067, 1475, 1815, 2007, 1815, 1475, 1067, 695, 351, 155;
  ...
		

Crossrefs

Cf. A016777 (row length), A179805, A285009, A341740, A342467 (row sums).

Programs

Extensions

Terms a(14) and beyond from Andrew Howroyd, Feb 05 2022
Showing 1-3 of 3 results.