OFFSET
1,1
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..10000
N. Fernandez, An order of primeness, F(p)
N. Fernandez, An order of primeness [cached copy, included with permission of the author]
EXAMPLE
31 is a term: 31 -> 11 -> 5 -> 3 -> 2 -> 1, five (a prime number of) steps "->" = pi = A000720.
MAPLE
b:= proc(n) option remember;
`if`(isprime(n), 1+b(numtheory[pi](n)), 0)
end:
a:= proc(n) option remember; local p;
p:= `if`(n=1, 1, a(n-1));
do p:= nextprime(p);
if isprime(b(p)) then break fi
od; p
end:
seq(a(n), n=1..55);
MATHEMATICA
b[n_] := b[n] = If[!PrimeQ[n], 0, 1+b[PrimePi[n]]];
okQ[n_] := PrimeQ[n] && PrimeQ[b[n]];
Select[Range[2000], okQ] (* Jean-François Alcover, May 30 2022 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Mar 15 2020
STATUS
approved