cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A269734 a(n) = number of hermit primes (A268343) that are <= prime(n).

This page as a plain text file.
%I A269734 #9 Mar 09 2016 09:31:24
%S A269734 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,
%T A269734 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,
%U A269734 13,14,14,14,15,15,15,15,15,15,16,16,16,16,16,17,17,17,18
%N A269734 a(n) = number of hermit primes (A268343) that are <= prime(n).
%H A269734 N. J. A. Sloane, <a href="/A269734/b269734.txt">Table of n, a(n) for n = 1..30000</a>
%p A269734 # Assumes that b1 is a list of the terms in A268343
%p A269734 ans:=[]; ct:=0; M:=120; t1:=1; t2:=b1[t1];
%p A269734 for i from 1 to M do
%p A269734 if ithprime(i)<t2 then ans:=[op(ans),ct];
%p A269734 else ct:=ct+1; t1:=t1+1; t2:=b1[t1]; ans:=[op(ans),ct];
%p A269734 fi;
%p A269734 od;
%p A269734 ans;
%Y A269734 Cf. A268343.
%K A269734 nonn
%O A269734 1,12
%A A269734 _N. J. A. Sloane_, Mar 09 2016