|
|
A066800
|
|
Number of different eventual period lengths for power sequences mod n; i.e., number of different period lengths of repeating digits of 1/n in different bases.
|
|
4
|
|
|
1, 1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 2, 6, 4, 3, 3, 5, 4, 6, 3, 4, 4, 4, 2, 6, 6, 6, 4, 6, 3, 8, 4, 4, 5, 6, 4, 9, 6, 6, 3, 8, 4, 8, 4, 6, 4, 4, 3, 8, 6, 5, 6, 6, 6, 6, 4, 6, 6, 4, 3, 12, 8, 4, 5, 6, 4, 8, 5, 4, 6, 8, 4, 12, 9, 6, 6, 8, 6, 8, 3, 8, 8, 4, 4, 5, 8, 6, 4, 8, 6, 6, 4, 8, 4, 9, 4, 12, 8, 8, 6, 9, 5, 8
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
FORMULA
|
Number of divisors of reduced totient function: a(n) = A000005(A002322(n)).
Sum_{k=1..n} a(k) ~ n * exp(c(n) * (log(n)/log(log(n)))(1/2) * (1 + O(log(log(log(n)))/log(log(n))))), where c(n) is a number in the interval (1/7, 2*sqrt(2))*exp(-gamma/2) and gamma is A001620 (Luca and Pomerance, 2007). - Amiram Eldar, Oct 29 2022
|
|
EXAMPLE
|
Modulo 5, powers of 1,6,11 etc. are 1,1,1,1,1,1,...; of 2,7,12 etc. are 1,2,4,3,1,2,4,3,...; of 3,8,13 etc. are 1,3,4,2,1,3,4,2,...; of 4,9,14 etc. are 1,4,1,4,1,4,...; of 5,10,15 etc. are 1,0,0,0,0,... So the eventual period lengths are 1,4,4,2,1 giving three distinct lengths, so a(5)=3.
|
|
MAPLE
|
numtheory[tau](numtheory[lambda](n)) ;
end proc:
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI)
|
|
CROSSREFS
|
This is the number of different values of rows of the square array A066799.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|