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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049047 Number of distinct factorial numbers congruent to 1 (mod prime(n)). 0
1, 1, 2, 2, 2, 2, 4, 2, 5, 3, 3, 2, 2, 2, 2, 4, 4, 5, 3, 3, 4, 2, 4, 4, 4, 2, 3, 3, 3, 2, 2, 2, 3, 4, 5, 3, 2, 2, 3, 2, 2, 2, 2, 3, 2, 6, 3, 3, 3, 2, 5, 4, 2, 3, 2, 2, 2, 3, 3, 2, 3, 2, 4, 6, 2, 2, 5, 2, 2, 2, 2, 6, 2, 2, 3, 2, 4, 3, 5, 2, 3, 2, 3, 2, 5, 2, 5, 4, 5, 3, 5, 4, 3, 2, 4, 4, 2, 4, 2, 2, 3, 3, 2, 2, 4 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

CROSSREFS

Sequence in context: A003036 A089818 A067025 * A037088 A153436 A064486

Adjacent sequences:  A049044 A049045 A049046 * A049048 A049049 A049050

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

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 14:37 EST 2012. Contains 205822 sequences.