id:A099794 - OEIS Search Results

Search: id:A099794

Displaying 1-1 of 1 results found.

page 1

a(n) = smallest integer k such that k*prime(n) == 1 mod j for each integer j with 1<j<prime(n).

+0
4

1, 1, 5, 43, 2291, 6397, 423953, 2579419, 30364247, 77544004469, 1277242663471, 70250377083373, 3909462041753561, 101888460343995907, 8217087542785091183, 2455846588270412484317, 38974424104246263663539 (list; graph; listen)

	OFFSET	`1,3`
	FORMULA	`a(n) = A094998(n) / prime(n).`
	CROSSREFS	`Cf. A094998, A099795, A099796.` `Adjacent sequences: A099791 A099792 A099793 this_sequence A099795 A099796 A099797` `Sequence in context: A114604 A085098 A118085 this_sequence A079646 A098891 A030698`
	KEYWORD	`nonn`
	AUTHOR	`Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 29 2004`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research