|
%I #17 Sep 03 2019 14:26:14
%S 3,2,2,1,1,2,2,1,1,2,2,1,1,2,1,1,1,1,2,2,1,1,1,1,2,1,1,2,2,1,1,2,1,1,
%T 1,1,2,1,1,1,1,2,2,1,1,1,1,2,1,1,2,2,1,1,1,1,2,1,1,2,1,1,1,1,2,1,1,1,
%U 1,1,1,2,1,1,2,2,1,1,2,2,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,2,1,1,1,1,2,2
%N Number of occurrences of n-th prime in A065308, where A065308(j) = prime(j - pi(j)).
%C Seems identical to A054546. Each odd prime arises once or twice!?
%H Harry J. Smith, <a href="/A065310/b065310.txt">Table of n, a(n) for n = 1..1000</a>
%t t=Table[Prime[w-PrimePi[w]], {w, a, b}] Table[Count[t, Prime[n]], {n, c, d}]
%o (PARI) { p=1; f=2; m=1; for (n=1, 1000, a=0; p=nextprime(p + 1); while (p==f, a++; m++; f=prime(m - primepi(m))); write("b065310.txt", n, " ", a) ) } \\ _Harry J. Smith_, Oct 16 2009
%Y Cf. A000040, A000720, A054576, A065308-A065309.
%K nonn
%O 1,1
%A _Labos Elemer_, Oct 29 2001
|
