|
%I #4 Mar 31 2012 20:47:12
%S 4,5,13,15,26,32,44,65,71,93,107,111,131,156,184,186,217,235,239,269,
%T 283,317,360,380,387,405,409,429,507,529,572,578,626,628,662,692,718,
%U 753,783,797,864,868,888,892,978,1044,1062,1072,1099,1121,1129,1205
%N a(n) = Prime[Abs[n-Prime[n-1]]] + PrimePi[ n- PrimePi[n-2]]
%C A prime based function based on A005185 as a pattern in a reinversion sequence.
%t prid[n_Integer?Positive] := prid[n] =Prime[Abs[n-Prime[n-1]]] + PrimePi[ n- PrimePi[n-2]] prid[1] = prid[2] = 1 digits=256 a=Table[prid[n], {n, 4, digits+4}]
%Y Cf. A005185.
%K nonn
%O 4,1
%A _Roger L. Bagula_, Oct 12 2003
|
