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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067999 Numbers n such that (n! - 1) == 0 ( mod prime(n) ). 2
1, 3, 10, 149, 437 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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

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}] (from Robert G. Wilson v Mar 16 2004)

CROSSREFS

Cf. A068000.

Sequence in context: A199232 A056006 A191363 * A156193 A119035 A004100

Adjacent sequences:  A067996 A067997 A067998 * A068000 A068001 A068002

KEYWORD

nonn,more

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 08 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 04:23 EST 2012. Contains 205694 sequences.