|
|
A100994
|
|
If n is a prime power p^m, m >= 1, then n, otherwise 1.
|
|
10
|
|
|
1, 2, 3, 4, 5, 1, 7, 8, 9, 1, 11, 1, 13, 1, 1, 16, 17, 1, 19, 1, 1, 1, 23, 1, 25, 1, 27, 1, 29, 1, 31, 32, 1, 1, 1, 1, 37, 1, 1, 1, 41, 1, 43, 1, 1, 1, 47, 1, 49, 1, 1, 1, 53, 1, 1, 1, 1, 1, 59, 1, 61, 1, 1, 64, 1, 1, 67, 1, 1, 1, 71, 1, 73, 1, 1, 1, 1, 1, 79, 1, 81, 1, 83, 1, 1, 1, 1, 1, 89, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
a(n) is the smallest positive integer such that n divides lcm(a(1), a(2), a(3), ..., a(n)), for all positive integers n. - Leroy Quet, May 01 2007
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
a[n_] := If[PrimePowerQ[n], n, 1];
|
|
PROG
|
(PARI) a(n) = if (isprimepower(n), n, 1); \\ Michel Marcus, Mar 18 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|