A073366 - 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

A073366

Remainder when n-th prime is divided by number of composites not exceeding n.

0, 0, 1, 1, 1, 3, 4, 1, 1, 5, 1, 7, 8, 5, 1, 7, 5, 1, 1, 5, 5, 7, 5, 1, 17, 1, 18, 13, 11, 11, 7, 11, 7, 13, 13, 11, 11, 17, 13, 23, 19, 17, 13, 25, 31, 29, 25, 23, 23, 25, 29, 29, 29, 29, 25, 31, 29, 31, 35, 43, 41, 37, 35, 2, 1, 4, 49, 3, 2, 10, 9, 8, 5, 4, 5, 9, 10, 13, 8, 18, 13, 12

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

OFFSET

4,6

LINKS

Michael De Vlieger, Table of n, a(n) for n = 4..10000

FORMULA

a(n) = A000040(n) mod A065855(n).

EXAMPLE

For n=4, p(4) mod 4-Pi(4)-1 = 7 mod 1 = 0 = a(4).

MATHEMATICA

Table[Mod[Prime[w], w-PrimePi[w]-1], {w, 1, 128}]

CROSSREFS