|
|
A087023
|
|
Maximal exponent in prime factorization of n-th cyclic number.
|
|
4
|
|
|
3, 2, 4, 2, 2, 2, 2, 3, 3, 5, 2, 2, 2, 2, 2, 4, 3, 3, 3, 2, 2, 2, 2, 3, 3, 3, 5, 2, 2, 2, 5, 2, 7, 2, 3, 2, 2, 5, 3, 4, 2, 3, 2, 2, 2, 3, 3, 2, 6, 2, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
A004042(n) factorized with Dario Alpern's ECM.
Extended using factors of 10^(A001913(n)-1)-1, see Kamada link.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
A004042(2) = 142857 = 37*13*11*3^3, therefore a(1) = 3.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|