This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A327663 #14 May 07 2025 12:19:51
%S A327663 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,
%T A327663 23,6,30,30,30,32,30,30,30,30,30,30,35,30,38,34,30,38,44,42,42,40,42,
%U A327663 30,51,48,45,42,48,52,58,30,60,50,42,62,35,30,62,66,48
%N A327663 Maximum value of primorials mod n.
%H A327663 Rémy Sigrist, <a href="/A327663/b327663.txt">Table of n, a(n) for n = 1..10000</a>
%H A327663 Rémy Sigrist, <a href="/A327663/a327663.gp.txt">PARI program for A327663</a>
%e A327663 For n = 8:
%e A327663 - the first primorials mod 8 are:
%e A327663 k prime(k)#
%e A327663 - ---------
%e A327663 0 1
%e A327663 1 2
%e A327663 2 6
%e A327663 3 6
%e A327663 4 2
%e A327663 - the prime numbers > 8 are of the form k + m*8, with m > 0 and k in {1, 3, 5, 7},
%e A327663 - 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,
%e A327663 - hence a(8) = 6.
%o A327663 (PARI) See Links section.
%Y A327663 Cf. A002110, A062170.
%K A327663 nonn
%O A327663 1,3
%A A327663 _Rémy Sigrist_, Sep 21 2019