login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A144728 a(n)= smallest positive integer k such that a(0)*a(1)*a(2)*...*a(n) + 1 is prime. a(0)=6 13

%I

%S 1,2,3,5,9,12,16,22,25,29,31,35,47,57,61,66,79,81,108,114,148,163,172,

%T 185,198,203,205,236,265,275,282,294,312,344,359,377,397,398,411,427,

%U 431,493,512,589,647,648,660,708,719,765,887,911,916,935,1062,1093,1102

%N a(n)= smallest positive integer k such that a(0)*a(1)*a(2)*...*a(n) + 1 is prime. a(0)=6

%t k = 6; a = {}; Do[If[PrimeQ[k n + 1], k = k n; AppendTo[a, n]], {n, 1, 3000}]; a (*Artur Jasinski*)

%Y A046966, A046972, A144717, A144718, A144722, A144723, A144724, A144725, A144726, A144727, A144728, A144729, A144730, A144731

%K nonn

%O 1,2

%A _Artur Jasinski_, Sep 19 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 24 16:47 EDT 2019. Contains 323533 sequences. (Running on oeis4.)