A225152 Let b(k) be A036378, then a(n) is the number of b(k) terms such that 2^n < b(k) <= 2^(n+1).

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

Offset

0,1

Comments

A036378 is a complete sequence.

Links

Table of n, a(n) for n=0..39.

Example

a(7) = 2 as between 128 and 256 there are 2 terms (A036378) namely 137 and 255.

Mathematica

getterm[n2_] := PrimePi[2^(n2+1)]-PrimePi[2^n2];
termcount[n3_] := (m1=0; While[getterm[m1]<=2^n3, m1++]; m1);
Table[termcount[p+1]-termcount[p], {p, 0, 39}]

Crossrefs

Cf. A036378, A052005.

Sequence in context: A347550 A068320 A111330 * A117447 A328775 A053250

Adjacent sequences: A225149 A225150 A225151 * A225153 A225154 A225155

Keyword

nonn,more

Author

Frank M Jackson, Apr 30 2013

Status

approved