A374146 a(n) = prime(g) mod g where prime gap g = prime(n+1) - prime(n).

0, 1, 1, 3, 1, 3, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 3, 1, 1, 3, 1, 3, 3, 1, 3, 1, 3, 1, 3, 1, 1, 9, 1, 1, 1, 3, 1, 1, 1, 9, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 9, 1, 1, 1, 1, 1, 3, 1, 9, 1, 3, 1, 3, 1, 1, 9, 1, 3, 1, 3, 1, 1, 3, 1, 3, 3, 3, 9, 1, 9, 1, 1, 3, 1, 3, 3, 1, 3, 1, 3, 3, 3, 3, 1, 1, 1, 7

Offset

1,4

Links

Table of n, a(n) for n=1..99.

Formula

a(n) = A004648(A001223(n)).

Example

a(4) = prime(11 - 7) mod (11 - 7) = 7 mod 4 = 3.

Mathematica

a[n_]:=Mod[Prime[Prime[n+1]-Prime[n]], Prime[n+1]-Prime[n]]; Array[a, 99] (* Stefano Spezia, Jun 29 2024 *)

Crossrefs

Cf. A000040, A001223, A004648.

Sequence in context: A062174 A154754 A102368 * A277109 A359262 A373403

Adjacent sequences: A374143 A374144 A374145 * A374147 A374148 A374149

Keyword

nonn,easy

Author

Zachary Marino, Jun 28 2024

Status

approved