The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A333368

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A333368

Primes of the form k*m^(k*m) - 1 with m > 1.
(history; published version)

#26 by Alois P. Heinz at Tue May 26 22:00:55 EDT 2020

STATUS

proposed

approved

#25 by Jinyuan Wang at Tue May 26 20:13:15 EDT 2020

STATUS

editing

proposed

Discussion

Tue May 26

22:00

Alois P. Heinz: ok ...

#24 by N. J. A. Sloane at Sat May 16 02:20:04 EDT 2020

STATUS

proposed

editing

Discussion

Sat May 23

07:04

OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review.  If it is ready for review, please
visit https://oeis.org/draft/A333368 and click the button that reads
"These changes are ready for review by an OEIS Editor."

Thanks.
  - The OEIS Server

Tue May 26

20:13

Jinyuan Wang: my program guarantees that there's no gaps...

#23 by Sean A. Irvine at Thu Apr 02 22:12:00 EDT 2020

STATUS

editing

proposed

Discussion

Mon May 11

01:25

N. J. A. Sloane: Jinyuan,  how far have you checked these terms?  For example, can we be sure that there are no missing terms below 1046695266054721074427023041 ?  That is a VERY large number!

Sat May 16

02:20

N. J. A. Sloane: Jinyuan,  I am moving this to the Editing stack, because I would like you to confirm that there are no gaps in the sequence

#22 by Sean A. Irvine at Thu Apr 02 22:11:50 EDT 2020

LINKS

Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a333/A333368.java">Java program</a> (github)

STATUS

proposed

editing

Discussion

Thu Apr 02

22:12

Sean A. Irvine: Terms verified.

#21 by Jinyuan Wang at Wed Mar 18 01:24:02 EDT 2020

STATUS

editing

proposed

Discussion

Wed Mar 18

04:22

Michel Marcus: so my 11:49 discussion was not ok

#20 by Jinyuan Wang at Wed Mar 18 01:23:48 EDT 2020

PROG

(PARI) lista(nn) = {my(k, n=2, v=List([]), x=4, y); while(x<nn, k=1; y=x-1; while(y<nn, if(ispseudoprime(y), listput(v, y)); k++; y=k*x^k-1); n++; x=n^n); Set(v); } \\ Jinyuan Wang, Mar 18 2020

#19 by Michel Marcus at Wed Mar 18 01:20:16 EDT 2020

NAME

Primes of the form k*nm^(k*nm) - 1 with n m > 1.

PROG

(PARI) for(k=1, 9999, for(n=2, 9999, isprime(p=k*n^(k*n)-1)&print1(p, ", ")))

(PARI) T(n, k) = k*n^(k*n)-1;

lista(nn) = {my(list = List()); for (n=2, nn, for (k=1, n-1, if (isprime(x=T(k+1, n-k)), listput(list, x)); ); ); vecsort(Vec(list)); } \\ Michel Marcus, Mar 17 2020

KEYWORD

nonn,hard,easy,changed

STATUS

proposed

editing

Discussion

Wed Mar 18

01:20

Michel Marcus: please add your program; for me it is better than 2 previous ones

#18 by Jinyuan Wang at Tue Mar 17 21:03:14 EDT 2020

STATUS

editing

proposed

Discussion

Tue Mar 17

21:13

Jinyuan Wang: also I think it is "easy", about 20 s to make a b-file (all terms up to 10^1000)

#17 by Jinyuan Wang at Tue Mar 17 21:00:02 EDT 2020

NAME

Primes of the form k*n^(k*n) - 1 with n > 1.

DATA

3, 31, 191, 5119, 131071, 524287, 3758096383, 4353564671, 1356446145697, 1618481116086271, 2058911320946489, 1046695266054721074427023041, 847823165504324070285888664019, 5359447279004780799548150067050349330431, 21972514049024273909927586495034261457859960185070216715886416125181937581996113912817103802133904744169307240538184064530443801964688726052818649087

EXTENSIONS

Corrected by Michel Marcus, and _Jinyuan Wang_, Mar 17 2020

STATUS

proposed

editing

Discussion

Tue Mar 17

21:03

Jinyuan Wang: ... I have a prog which can accurately calculate all terms less than "nn" ... but since it's ugly, I do not want to add it