|
|
A256394
|
|
Prime values of pi(n) that divide n.
|
|
4
|
|
|
2, 3, 11, 67, 71, 439, 1051, 6469, 40087, 100361, 100363, 251737, 251761, 637319, 637327, 4124459, 10553513, 10553551, 27067277, 69709733, 179993171, 465769817, 3140421769, 8179002109, 8179002133, 55762149029, 55762149071, 382465573489, 1003652347081
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
a(n) is the largest prime factor of n, since pi(n) ~ n / log n.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
pi(6) = 3 is prime, and 3 divides 6, so 3 is a member.
|
|
MATHEMATICA
|
c = 0; lpf[n_] := If[ PrimeQ[n], c++; n, Transpose[ FactorInteger[n]][[1, -1]]]; Do[ If[lpf[n] == c, Print[ PrimePi[n]]], {n, 2, 10^7}]
PrimePi[Select[Select[Range[2, 10^6], IntegerQ[#/PrimePi[#]]&], PrimeQ[PrimePi[#]]&]] (* Ivan N. Ianakiev, Apr 15 2015 *)
Select[Table[{PrimePi[n], n}, {n, 10^6}], PrimeQ[#[[1]]]&&Divisible[#[[2]], #[[1]]]&][[All, 1]] (* The program generates the first 9 terms of the sequence. To generate more, increase the constant for n. *) (* Harvey P. Dale, Feb 08 2022 *)
|
|
PROG
|
(PARI) for(n=1, 10^6, if(isprime(p=primepi(n))&&!(n%primepi(n)), print1(p, ", "))) \\ Derek Orr, Apr 14 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|