id:A100612 - OEIS Search Results

Search: id:A100612

Displaying 1-1 of 1 results found.

page 1

a(n)=(0! + 1! + ... + (p-1)!) mod p, where p = prime(n).

+0
2

0, 1, 4, 6, 1, 10, 13, 9, 21, 17, 2, 5, 4, 16, 18, 13, 28, 22, 65, 68, 55, 20, 27, 76, 80, 13, 50, 43, 65, 109, 56, 81, 93, 134, 82, 10, 131, 4, 30, 104, 29, 170, 104, 165, 9, 122, 130, 42, 225, 50, 69, 12, 128, 60, 147, 52, 16, 56, 7, 218, 154, 264, 198, 48, 299, 205, 251, 101 (list; graph; listen)

	OFFSET	`1,3`
	REFERENCES	`R. K. Guy, Unsolved Problems in Number Theory, B44: is a(n)>0 for n>2?`
	LINKS	`T. D. Noe, Plot of first 5000 terms (The red line gives prime(n). There are very few duplicate values in the sequence; the 5000 terms have 4476 values.)`
	CROSSREFS	`See A049782 for more information.` `Sequence in context: A021688 A119439 A090642 this_sequence A079160 A016491 A124259` `Adjacent sequences: A100609 A100610 A100611 this_sequence A100613 A100614 A100615`
	KEYWORD	`nonn`
	AUTHOR	`njas, Dec 02 2004`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research