A327663 Maximum value of primorials mod n.

0, 1, 2, 2, 2, 2, 6, 6, 6, 6, 8, 6, 9, 6, 6, 14, 15, 12, 18, 10, 9, 12, 15, 18, 20, 22, 24, 14, 23, 6, 30, 30, 30, 32, 30, 30, 30, 30, 30, 30, 35, 30, 38, 34, 30, 38, 44, 42, 42, 40, 42, 30, 51, 48, 45, 42, 48, 52, 58, 30, 60, 50, 42, 62, 35, 30, 62, 66, 48

Offset

1,3

Links

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, PARI program for A327663

Example

For n = 8:
- the first primorials mod 8 are:
    k  prime(k)#
    -  ---------
    0          1
    1          2
    2          6
    3          6
    4          2
- the prime numbers > 8 are of the form k + m*8, with m > 0 and k in {1, 3, 5, 7},
- starting from 2, and iteratively multiplying by a number in {1, 3, 5, 7} mod 8, we can only reach 2 or 6, and this value has already been reached before,
- hence a(8) = 6.

Prog

(PARI) See Links section.

Crossrefs

Cf. A002110, A062170.

Sequence in context: A260188 A048764 A386369 * A248782 A038714 A139554

Adjacent sequences: A327660 A327661 A327662 * A327664 A327665 A327666

Keyword

nonn

Author

Rémy Sigrist, Sep 21 2019

Status

approved