|
|
|
|
2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The prime p that minimizes p^(1+nu_p(n)), where nu_p(n) is the p-adic order of n.
It satisfies p^(1+nu_p(n)) = A007978(n).
|
|
LINKS
|
|
|
MAPLE
|
Primes:= select(isprime, [2, seq(2*i+1, i=1..100)]):
seq(Primes[min[index](map(p -> p^(1+padic[ordp](n, p)), Primes))], n=1..200);
|
|
MATHEMATICA
|
Table[(LCM[n, Min[Complement[Range[n+1], Divisors[n]]]]/n), {n, 100}] (* Vincenzo Librandi, May 21 2015 *)
|
|
PROG
|
(Haskell)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|