OFFSET
1,2
COMMENTS
To compute a(n):
- a(1) = 1,
- for n > 1:
- consider the prime factorization of n:
n = Product_{i = 1..k} prime(i)^e_i
(where e_k > 0 and prime(i) denotes the i-th prime number),
- apply the Look and Say procedure to the list (e_k, ..., e_1),
- the result, say (f_m, ..., f_1), gives the prime exponents for a(n):
a(n) = Product_{i = 1..m} prime(i)^f_i.
There are only two fixed points: a(1) = 1 and a(36) = 36.
LINKS
Rémy Sigrist, PARI program
FORMULA
EXAMPLE
For n = 99:
- 99 = 11^1 * 7^0 * 5^0 * 3^2 * 2^0,
- the list of exponents is: 1 0 0 2 0,
- applying the Look and Say procedure, we obtain: 1 1 2 0 1 2 1 0,
- so a(99) = 19^1 * 17^1 * 13^2 * 11^0 * 7^1 * 5^2 * 3^1 * 2^0 = 28658175.
PROG
(PARI) See Links section.
CROSSREFS
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Jul 23 2022
STATUS
approved