A099362 Number of times the n-th prime is crossed off in the sieve of A099361.

0, 0, 1, 0, 2, 0, 1, 1, 1, 0, 3, 0, 1, 1, 1, 0, 2, 1, 2, 1, 1, 0, 2, 0, 2, 1, 1, 0, 2, 0, 1, 3, 1, 0, 2, 0, 1, 1, 3, 0, 2, 0, 1, 1, 2, 1, 2, 0, 2, 1, 1, 0, 3, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 0, 2, 0, 2, 2, 2, 0, 3, 0, 1, 2, 1, 0, 2, 0, 1, 1, 2, 0, 2, 1, 1, 2, 1, 1, 2, 0, 1, 1, 1, 0, 3, 0, 3, 1, 1, 0, 3, 1, 1, 1, 1

Offset: 1

Author

N. J. A. Sloane, Nov 18 2004

Keywords

• nonn
• easy

Programs

Mathematica

nn = 300; a = Prime[Range[nn]]; cnt = Table[0, {nn}]; Do[p = a[[i]]; If[p > 0, Do[a[[j]] = 0; cnt[[j]]++, {j, i + p, nn, p}]], {i, nn}]; cnt (* T. D. Noe, Apr 15 2011 *)

Extensions

More terms from Ray Chandler, Nov 19 2004