The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A067999

Numbers k such that (k! - 1) == 0 (mod prime(k)).
(history; published version)

#18 by Joerg Arndt at Thu Feb 11 01:36:22 EST 2021

STATUS

reviewed

approved

#17 by Michel Marcus at Thu Feb 11 01:30:02 EST 2021

STATUS

proposed

reviewed

#16 by Michel Marcus at Thu Feb 11 01:29:57 EST 2021

STATUS

editing

proposed

#15 by Michel Marcus at Thu Feb 11 01:29:54 EST 2021

MATHEMATICA

f[n_] := Block[{k = p = 1, m = Prime[n]}, While[p = Mod[p k, m]; k < n, k++ ]; p]; Do[ If[ f[n] == 1, Print[n]], {n, 100000}] (* Robert G. Wilson v , Mar 16 2004 *)

STATUS

reviewed

editing

#14 by Joerg Arndt at Thu Feb 11 01:21:54 EST 2021

STATUS

proposed

reviewed

#13 by Jon E. Schoenfield at Wed Feb 10 21:09:46 EST 2021

STATUS

editing

proposed

#12 by Jon E. Schoenfield at Wed Feb 10 21:09:44 EST 2021

NAME

Numbers n k such that (nk! - 1) == 0 ( mod prime(nk) ).

COMMENTS

Numbers n k such that A091858(nk) = 1. - Zak Seidov, Oct 05 2012

STATUS

approved

editing

#11 by N. J. A. Sloane at Thu Oct 31 12:17:19 EDT 2013

MATHEMATICA

f[n_] := Block[{k = p = 1, m = Prime[n]}, While[p = Mod[p k, m]; k < n, k++ ]; p]; Do[ If[ f[n] == 1, Print[n]], {n, 100000}] (* _Robert G. Wilson v _ Mar 16 2004 *)

Discussion

Thu Oct 31

12:17

OEIS Server: https://oeis.org/edit/global/2036

#10 by Charles R Greathouse IV at Tue Sep 24 09:21:33 EDT 2013

COMMENTS

There are no more terms through 5000000. - _Ryan Propper (rpropper(AT)cs.stanford.edu), _, Dec 30 2007

Discussion

Tue Sep 24

09:21

OEIS Server: https://oeis.org/edit/global/1945

#9 by T. D. Noe at Fri Oct 05 14:55:58 EDT 2012

STATUS

editing

approved