Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067999
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067999 Numbers n such that (n! - 1) == 0 ( mod prime(n) ). +0
3
1, 3, 10, 149, 437 (list; graph; listen)
OFFSET

1,2

COMMENT

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: A132480 A074260 A056006 this_sequence A119035 A004100 A103156

Adjacent sequences: A067996 A067997 A067998 this_sequence A068000 A068001 A068002

KEYWORD

nonn,more

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research