login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A141235 Sequence of k such that starting with P(0)=13 then k(n)*P(n-1)*(k(n)*P(n-1)-1)-1 is the least prime = P(n). 2
3, 2, 15, 8, 11, 70, 271, 429, 189, 109 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
1*13*(1*13-1)-1=155 composite,
2*13*(2*13-1)-1=649 composite,
3*13*(3*13-1)-1=1481 prime so a(1)=3 and P(1)=1481.
PROG
(PARI) P=13; for(i=1, 20, k=0; while(!ispseudoprime(t=k++*P*(k*P-1)-1), ); P=t; print1(k", ")) \\ Michel Marcus, Sep 24 2019
CROSSREFS
Sequence in context: A072346 A334865 A103236 * A199167 A218969 A345291
KEYWORD
nonn,more
AUTHOR
Pierre CAMI, Jun 16 2008
EXTENSIONS
a(9)-a(10) from Michel Marcus, Sep 24 2019
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 6 18:59 EDT 2024. Contains 372297 sequences. (Running on oeis4.)