cp's OEIS Frontend

A334006 Triangle read by rows: T(n,k) = (the number of nonnegative bases m < n such that m^k == m (mod n))/(the number of nonnegative bases m < n such that -m^k == m (mod n)) for nonnegative k < n, n >= 1.

%I A334006 #56 Sep 08 2022 08:46:25
%S A334006 1,1,1,1,3,1,1,2,1,3,1,5,1,1,1,1,3,1,3,1,3,1,7,1,3,1,3,1,1,4,1,5,1,5,
%T A334006 1,5,1,9,1,3,1,3,1,7,1,1,5,1,1,1,5,1,1,1,5,1,11,1,3,1,3,1,3,1,3,1,1,6,
%U A334006 1,9,1,9,1,9,1,9,1,9,1,13,1,1,1,5,1,1,1,5,1,1,1,1,7,1,3,1,3
%N A334006 Triangle read by rows: T(n,k) = (the number of nonnegative bases m < n such that m^k == m (mod n))/(the number of nonnegative bases m < n such that -m^k == m (mod n)) for nonnegative k < n, n >= 1.
%C A334006 If the sum of proper divisors of q in row q <= q, then q are 1, 2, 3, 4, 5, 8, 16, 17, 32, 64, 128, 256, 257, ...(union of Fermat primes and powers of 2).
%e A334006 Triangle T(n,k) begins:
%e A334006   n\k| 0   1  2  3  4   5  6  7  8   9 10 11 12  13 14 15 16
%e A334006   ---+------------------------------------------------------
%e A334006    1 | 1;
%e A334006    2 | 1,  1;
%e A334006    3 | 1,  3, 1;
%e A334006    4 | 1,  2, 1, 3;
%e A334006    5 | 1,  5, 1, 1, 1;
%e A334006    6 | 1,  3, 1, 3, 1,  3;
%e A334006    7 | 1,  7, 1, 3, 1,  3, 1;
%e A334006    8 | 1,  4, 1, 5, 1,  5, 1, 5;
%e A334006    9 | 1,  9, 1, 3, 1,  3, 1, 7, 1;
%e A334006   10 | 1,  5, 1, 1, 1,  5, 1, 1, 1,  5;
%e A334006   11 | 1, 11, 1, 3, 1,  3, 1, 3, 1,  3, 1;
%e A334006   12 | 1,  6, 1, 9, 1,  9, 1, 9, 1,  9, 1, 9;
%e A334006   13 | 1, 13, 1, 1, 1,  5, 1, 1, 1,  5, 1, 1, 1;
%e A334006   14 | 1,  7, 1, 3, 1,  3, 1, 7, 1,  3, 1, 3, 1, 7;
%e A334006   15 | 1, 15, 1, 3, 1, 15, 1, 3, 1, 15, 1, 3, 1, 15, 1;
%e A334006   16 | 1,  8, 1, 5, 1,  9, 1, 5, 1,  9, 1, 5, 1,  9, 1, 5;
%e A334006   17 | 1, 17, 1, 1, 1,  1, 1, 1, 1,  1, 1, 1, 1,  1, 1, 1, 1;
%e A334006   ...
%e A334006 For (n, k) = (7, 3), there are three nonnegative values of m < n such that m^3 == m (mod 7) (namely 0, 1, and 6) and one nonnegative value of m < n such that -m^3 == m (mod 7) (namely 0), so T(7,3) = 3/1 = 3.
%o A334006 (Magma) [[#[m: m in [0..n-1] | m^k mod n eq m]/#[m: m in [0..n-1] | -m^k mod n eq m]: k in [0..n-1]]: n in [1..17]];
%o A334006 (PARI) T(n, k) = sum(m=0, n-1, Mod(m, n)^k == m)/sum(m=0, n-1, -Mod(m, n)^k == m);
%o A334006 matrix(7, 7, n, k, k--; if (k>=n, 0, T(n,k))) \\ to see the triangle \\ _Michel Marcus_, Apr 17 2020
%Y A334006 Cf. A000012, A000079, A002322, A010684, A019434, A023506, A026741, A182816, A333570, A337454, A337632, A337633, A337820, A337910.
%K A334006 nonn,tabl
%O A334006 1,5
%A A334006 _Juri-Stepan Gerasimov_, Apr 12 2020
%E A334006 Name corrected by _Peter Kagey_, Sep 12 2020