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,12

Links

N. J. A. Sloane, Table of n, a(n) for n = 1..30000

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)<t2 then ans:=[op(ans), ct];
else ct:=ct+1; t1:=t1+1; t2:=b1[t1]; ans:=[op(ans), ct];
fi;
od;
ans;

Crossrefs

Cf. A268343.

Sequence in context: A087181 A034973 A316626 * A066927 A060065 A057356

Adjacent sequences: A269731 A269732 A269733 * A269735 A269736 A269737

Keyword

nonn

Author

N. J. A. Sloane, Mar 09 2016

Status

approved