login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

a(n) = Prime[Prime[n-1]] + PrimePi[Abs[n - PrimePi[n-1]]]
0

%I #4 Mar 31 2012 20:47:12

%S 4,6,12,19,33,43,61,70,86,113,131,161,183,195,215,246,282,288,336,359,

%T 373,407,437,467,516,554,571,595,607,625,717,747,782,806,868,886,928,

%U 976,1000,1041,1073,1097,1163,1182,1212,1228,1308,1420,1444,1458,1483

%N a(n) = Prime[Prime[n-1]] + PrimePi[Abs[n - PrimePi[n-1]]]

%C Purely functional sequence undefined for n=1 based on the primes in a reinversion pattern based on A004001.

%t prid[n_Integer?Positive] := prid[n] =Prime[Prime[n-1]] + PrimePi[Abs[n - PrimePi[n-1]]] digits=256 a=Table[prid[n], {n, 2, digits}]

%Y Cf. A004001.

%K nonn

%O 2,1

%A _Roger L. Bagula_, Oct 12 2003