The On-Line Encyclopedia of Integer Sequences (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

A095245 revision #8

A095245

(Concatenation of first n primes) modulo prime(n).

0, 2, 0, 5, 3, 7, 15, 16, 21, 27, 7, 11, 17, 21, 37, 7, 28, 10, 50, 70, 70, 23, 46, 20, 76, 93, 81, 52, 1, 58, 87, 54, 100, 128, 39, 10, 117, 16, 42, 89, 98, 61, 135, 123, 13, 89, 201, 147, 124, 176, 186, 202, 71, 74, 256, 228, 137, 84, 145

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

OFFSET

0,2

LINKS

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

EXAMPLE

The concatenation of the first 3 primes is 235. The third prime is 5. Therefore a(3) = 235 mod 5 = 0.

MATHEMATICA

a = {2}; b = {0}; For[n = 2, n < 100, n++, a = Flatten[Join[a, IntegerDigits[ Prime[n]]] ]; AppendTo[b, Mod[FromDigits[a], Prime[n]]]]; b

Table[Mod[FromDigits[Flatten[IntegerDigits/@Prime[Range[n]]]], Prime[n]], {n, 60}] (* Harvey P. Dale, May 30 2018 *)

CROSSREFS

Cf. A095243.