cp's OEIS Frontend

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.

A073917 Smallest prime which leaves a remainder 1 when divided by primorial(n), i.e., when divided by first n primes.

This page as a plain text file.
%I A073917 #14 Jul 30 2017 03:45:34
%S A073917 3,7,31,211,2311,120121,4084081,106696591,892371481,71166625531,
%T A073917 200560490131,29682952539241,2129751844690471,78496567990020181,
%U A073917 8608456956238879741,97767475431570134191,9613801750771063195351
%N A073917 Smallest prime which leaves a remainder 1 when divided by primorial(n), i.e., when divided by first n primes.
%C A073917 Let Pr(n) = the product of first n primes. Then a(n) is the smallest prime of the form k*Pr(n) + 1. k = 1 for first five terms.
%C A073917 Smallest prime p such that the prime factorization of p-1 contains the first n primes. - _R. J. Mathar_, Jul 03 2012
%H A073917 T. D. Noe, <a href="/A073917/b073917.txt">Table of n, a(n) for n = 1..150</a>
%o A073917 (PARI) a(n)=if(n<0,0,s=1; while(prime(s)%prod(i=1,n, prime(i))>1,s++); s)
%Y A073917 Cf. A002110 (primorials), A073915, A103783, A214089.
%Y A073917 Cf. A076689 (values of k).
%K A073917 nonn
%O A073917 1,1
%A A073917 _Amarnath Murthy_, Aug 18 2002
%E A073917 More terms from _Vladeta Jovovic_, Aug 20 2002