A385104 Triangle read by rows: T(n,k) is the number of residue classes obtained by solving mod(x^2,n) = k for x over the integers, n >= 1, k >= 0.

1, 1, 1, 1, 2, 0, 2, 2, 0, 0, 1, 2, 0, 0, 2, 1, 2, 0, 1, 2, 0, 1, 2, 2, 0, 2, 0, 0, 2, 4, 0, 0, 2, 0, 0, 0, 3, 2, 0, 0, 2, 0, 0, 2, 0, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 2, 2, 2, 0, 0, 0, 2, 0, 2, 4, 0, 0, 4, 0, 0, 0, 0, 2, 0, 0, 1, 2, 0, 2, 2, 0, 0, 0, 0, 2, 2, 0, 2, 1, 2, 2, 0, 2, 0, 0, 1, 2

Offset

1,5

Comments

The sum of each row is n.

Links

Jason Bard, Table of n, a(n) for n = 1..11325

Formula

T(n,0) = A000188(n).

T(n,1) = A060594(n).

T(n,n-1) = A000089(n).

Example

Triangle starts:
  1
  1 1
  1 2 0
  2 2 0 0
  1 2 0 0 2
  1 2 0 1 2 0
  1 2 2 0 2 0 0
  2 4 0 0 2 0 0 0
  3 2 0 0 2 0 0 2 0
  1 2 0 0 2 1 2 0 0 2
  ...

Mathematica

dat[n_] := Table[Reduce[Mod[x^2, n] == k, x, Integers], {k, 0, n - 1}]; countConditions[cond_] := Which[cond === False, 0, MatchQ[cond, x \[Element] Integers], 1, True, Length@Cases[cond, Equal[x, _], Infinity]]; counts = Flatten[Table[countConditions /@ dat[n], {n, 1, 20}]]

Prog

(PARI) T(n, k) = sum(i=1, n, Mod(i, n)^2 == k);
row(n) = vector(n, i, T(n, i-1)); \\ Michel Marcus, Jun 23 2025

Crossrefs

Cf. A000089, A000188, A060594, A096008.

Sequence in context: A373924 A028928 A343723 * A260149 A091379 A151758

Adjacent sequences: A385101 A385102 A385103 * A385105 A385106 A385107

Keyword

nonn,tabl

Author

Jason Bard, Jun 18 2025

Status

approved