login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087884 a(n) = PrimePi[PrimePi[n-1]] + Prime[Abs[n - Prime[n-1]]] 0

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

%S 3,4,13,15,25,31,43,63,70,92,106,110,130,154,183,185,215,233,237,267,

%T 281,315,357,377,383,401,405,425,504,526,568,574,622,624,658,688,714,

%U 748,779,793,859,863,883,887,973,1039,1057,1067,1093,1115,1123,1199

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

%C A prime based reinversion sequence based on the A004001 pattern.

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

%Y Cf. A004001.

%K nonn

%O 4,1

%A _Roger L. Bagula_, Oct 12 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 15:57 EDT 2024. Contains 371961 sequences. (Running on oeis4.)