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.

A368304 Table read by antidiagonals: T(n,k) is the number of tilings of the n X k torus up to horizontal and vertical reflections by an asymmetric tile.

Original entry on oeis.org

1, 4, 4, 6, 28, 6, 23, 194, 194, 23, 52, 2196, 7296, 2196, 52, 194, 26524, 350573, 350573, 26524, 194, 586, 351588, 17895736, 67136624, 17895736, 351588, 586, 2131, 4798174, 954495904, 13744131446, 13744131446, 954495904, 4798174, 2131
Offset: 1

Views

Author

Peter Kagey, Dec 21 2023

Keywords

Examples

			Table begins:
  n\k|   1      2         3             4                5
  ---+----------------------------------------------------
   1 |   1      4         6            23               52
   2 |   4     28       194          2196            26524
   3 |   6    194      7296        350573         17895736
   4 |  23   2196    350573      67136624      13744131446
   5 |  52  26524  17895736   13744131446   11258999068672
   6 | 194 351588 954495904 2932037300956 9607679419823148
		

Crossrefs

Programs

  • Mathematica
    A368304[n_,m_]:=1/(4*n*m) (DivisorSum[n, Function[d,DivisorSum[m,Function[c,EulerPhi[c]EulerPhi[d]4^(m*n/LCM[c,d])]]]]+If[EvenQ[n],n/2*DivisorSum[m, EulerPhi[#](4^(n*m/LCM[2,#])+4^((n-2)*m/LCM[2,#])*4^(2m/#)*Boole[EvenQ[#]])&],n*DivisorSum[m,EulerPhi[#](4^(n*m/#))&,EvenQ]]+If[EvenQ[m], m/2*DivisorSum[n,EulerPhi[#](4^(n*m/LCM[2,#])+4^((m-2)*n/LCM[2,#])*4^(2n/#)*Boole[EvenQ[#]])&],m*DivisorSum[n, EulerPhi[#](4^(m*n/#))&,EvenQ]]+Which[EvenQ[n]&&EvenQ[m],(n*m)/4 (3*2^(n*m)),OddQ[n*m],0,OddQ[n+m],(n*m)/2 (2^(n*m))])

A368303 Table read by downward antidiagonals: T(n,k) is the number of tilings of the n X k torus up to horizontal and vertical reflections by a tile that is fixed under 180-degree rotations but not horizontal or vertical reflections.

Original entry on oeis.org

1, 2, 2, 2, 5, 2, 4, 8, 8, 4, 4, 22, 24, 22, 4, 8, 44, 120, 120, 44, 8, 9, 135, 612, 1203, 612, 135, 9, 18, 362, 3892, 13600, 13600, 3892, 362, 18, 23, 1211, 25482, 177342, 337600, 177342, 25482, 1211, 23, 44, 3914, 176654, 2404372, 8962618, 8962618, 2404372, 176654, 3914, 44
Offset: 1

Views

Author

Peter Kagey, Dec 21 2023

Keywords

Examples

			Table begins:
  n\k| 1   2    3      4       5         6
  ---+------------------------------------
   1 | 1   2    2      4       4         8
   2 | 2   5    8     22      44       135
   3 | 2   8   24    120     612      3892
   4 | 4  22  120   1203   13600    177342
   5 | 4  44  612  13600  337600   8962618
   6 | 8 135 3892 177342 8962618 477371760
		

Crossrefs

Programs

  • Mathematica
    A368303[n_, m_]:=1/(4*n*m)*(DivisorSum[n, Function[d, DivisorSum[m, Function[c, EulerPhi[c]EulerPhi[d]2^(m*n/LCM[c, d])]]]] + If[EvenQ[n], n/2*DivisorSum[m, EulerPhi[#](2^(n*m/LCM[2, #]) + 2^((n - 2)*m/LCM[2, #])*2^(2m/#)*Boole[EvenQ[#]])&], n*DivisorSum[m, EulerPhi[#](2^(n*m/#))&, EvenQ]] + If[EvenQ[m], m/2*DivisorSum[n, EulerPhi[#](2^(n*m/LCM[2, #]) + 2^((m - 2)*n/LCM[2, #])*2^(2n/#)*Boole[EvenQ[#]])&], m*DivisorSum[n, EulerPhi[#](2^(m*n/#))&, EvenQ]] + n*m*2^((n*m)/2)*Which[OddQ[n*m], Sqrt[2], OddQ[n + m], 3/2, True, 7/4])

A368305 Table read by downward antidiagonals: T(n,k) is the number of tilings of the n X k torus up to horizontal reflections by two tiles that are both fixed under horizontal reflection.

Original entry on oeis.org

2, 3, 3, 4, 7, 4, 6, 14, 13, 6, 8, 40, 44, 34, 8, 14, 108, 218, 226, 78, 13, 20, 362, 1200, 2386, 1184, 237, 18, 36, 1182, 7700, 27936, 26892, 7700, 687, 30, 60, 4150, 51112, 361244, 674384, 354680, 50628, 2299, 46
Offset: 1

Views

Author

Peter Kagey, Dec 21 2023

Keywords

Examples

			Table begins:
  n\k|  1   2    3      4        5         6
  ---+--------------------------------------
   1 |  2   3    4      6        8        14
   2 |  3   7   14     40      108       362
   3 |  4  13   44    218     1200      7700
   4 |  6  34  226   2386    27936    361244
   5 |  8  78 1184  26892   674384  17920876
   6 | 13 237 7700 354680 17950356 955180432
		

Crossrefs

Programs

  • Mathematica
    A368305[n_, m_]:=1/(2*n*m)*(DivisorSum[n, Function[d, DivisorSum[m, EulerPhi[#]EulerPhi[d]2^(m*n/LCM[#, d])&]]] + n*If[EvenQ[n], DivisorSum[m, EulerPhi[#](2^(n*m/LCM[2, #]) + 2^((n - 2)*m/LCM[2, #])*4^(m/#))&]/2, DivisorSum[m, EulerPhi[#](2^((n - 1)*m/LCM[2, #])*2^(m/#))&]])
Showing 1-3 of 3 results.