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

A228885 Determinant of the n X n matrix with (i,j)-entry equal to 1 or 0 according as i + j is coprime to n or not.

Original entry on oeis.org

1, -1, -2, 0, 4, -4, -6, 0, 0, -16, -10, 0, 12, -36, -2048, 0, 16, 0, -18, 0, 27648, -100, -22, 0, 0, -144, 0, 0, 28, -4194304, -30, 0, 2048000, -256, -127401984, 0, 36, -324, -14155776, 0, 40, -764411904, -42, 0, 0, -484, -46, 0, 0, 0, -536870912, 0, 52, 0, -419430400000, 0, 3057647616, -784, -58, 0
Offset: 1

Views

Author

Zhi-Wei Sun, Sep 06 2013

Keywords

Comments

Conjecture: If n is squarefree, then (-1)^(n*(n-1)/2)*a(n) > 0.
When p^2 divides n with p prime, (i + n/p) + j is coprime to n if and only if i + j is coprime to n. So a(n) = 0 if n is not squarefree.
It is easy to show that Phi(n) divides a(n) for any n > 0, where Phi(n) is Euler's totient function. Also, a(p) = (-1)^((p-1)/2)*(p-1) for any odd prime p.

Examples

			a(1) = 1 since 1 + 1 = 2 is relatively prime to 1.
		

Crossrefs

Programs

  • Mathematica
    a[n_]:=Det[Table[If[GCD[i+j,n]==1,1,0],{i,1,n},{j,1,n}]]
    Table[a[n],{n,1,60}]
  • PARI
    a(n) = matdet(matrix(n, n, i, j, gcd(n, i+j)==1)); \\ Michel Marcus, Aug 25 2021

Formula

Conjectures from Ridouane Oudra, Mar 13 2025: (Start)
a(n) = (-1)^floor(n/2)*mu(n)^2*Product_{k=1..n} phi(gcd(n,k)).
a(n) = (-1)^floor(n/2)*mu(n)^2*Product_{d|n} phi(d)^phi(n/d).
a(n) = A057077(n)*A008966(n)*A349741(n)*A000010(n). (End)
Showing 1-1 of 1 results.