id:A094998 - OEIS Search Results

Search: id:A094998

Displaying 1-1 of 1 results found.

page 1

a(n) = smallest integer multiple of n-th prime, say k*prime(n), such that k*prime(n) == 1 mod j for each integer j with 1<j<prime(n).

+0
4

2, 3, 25, 301, 25201, 83161, 7207201, 49008961, 698377681, 2248776129601, 39594522567601, 2599263952084801, 160287943711896001, 4381203794791824001, 386203114510899285601, 130159869178331861668801 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n) = A099795(n) * A099796(n) + 1 = A099794(n) * prime(n).`
	CROSSREFS	`Cf. A099794, A099795, A099796.` `Sequence in context: A013312 A013318 A048674 this_sequence A109586 A060371 A130975` `Adjacent sequences: A094995 A094996 A094997 this_sequence A094999 A095000 A095001`
	KEYWORD	`nonn`
	AUTHOR	`Mark Troll (mtroll(AT)u.washington.edu), Oct 22 2004`
	EXTENSIONS	`Edited and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 29 2004`

page 1

Search completed in 0.002 seconds

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.

AT&T Labs Research