A269734 a(n) = number of hermit primes (A268343) that are <= prime(n).
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 13, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 17, 17, 17, 18
Offset: 1
Keywords
Links
- N. J. A. Sloane, Table of n, a(n) for n = 1..30000
Crossrefs
Cf. A268343.
Programs
-
Maple
# Assumes that b1 is a list of the terms in A268343 ans:=[]; ct:=0; M:=120; t1:=1; t2:=b1[t1]; for i from 1 to M do if ithprime(i)