A074905 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A074905

a(n) = number of terms in A030229 between prime(n) and prime(n+1).

0, 0, 1, 1, 0, 2, 0, 2, 1, 0, 3, 2, 0, 1, 1, 3, 0, 2, 1, 0, 2, 1, 3, 4, 0, 0, 1, 0, 1, 5, 1, 2, 0, 5, 0, 1, 3, 1, 0, 2, 0, 3, 0, 1, 0, 7, 7, 1, 0, 0, 2, 0, 2, 2, 2, 2, 0, 1, 1, 0, 2, 7, 1, 0, 1, 7, 2, 3, 0, 0, 2, 2, 1, 1, 2, 1, 5, 1, 2, 4, 0, 2, 0, 1, 0, 3, 3, 1, 1, 1, 4, 3, 1, 2, 2, 1, 6, 0, 6, 4, 3, 2, 2, 1, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,6

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..1000

EXAMPLE

Between prime(6)=13 and prime(7)=17 there are two terms in A030229, namely 14 and 15, so a(6) = 2.

MAPLE

readlib(issqr): sstmp := proc(n) local t1, i; t1 := 0; for i from ithprime(n) to ithprime(n+1) do if (issqrfree(i) = 'true' and mobius(i)=1) then t1 := t1+1; fi; od; t1; end: sstmp(200);

MATHEMATICA

nt[{a_, b_}]:=Count[MoebiusMu[Range[a+1, b-1]], 1]; nt/@Partition[Prime[ Range[ 110]], 2, 1] (* Harvey P. Dale, May 18 2021 *)

CROSSREFS

Cf. A030229, A061265, A061399.

Sequence in context: A319517 A321460 A177446 * A058548 A372876 A157030

Adjacent sequences: A074902 A074903 A074904 * A074906 A074907 A074908

KEYWORD

nonn

AUTHOR

Jani Melik, Sep 30 2002

EXTENSIONS

Clarified definition, corrected offset, edited. - N. J. A. Sloane, May 18 2021

STATUS

approved