A060427 - OEIS

This site is supported by donations to The OEIS Foundation.

A060427

Smallest prime p such that there are n strings of consecutive integers all having products = 1 mod p.

2, 11, 17, 23, 71, 71, 599, 599, 3011, 27901, 52163, 778699, 2374649, 10428007 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	LINKS	`C. Rivera, Prime Puzzles`
	EXAMPLE	`For n = 2 we have 34 = 567 = 1 mod 11. For n = 3 we have 2345 = 67891011 = 12131415 = 1 mod 17.`
	CROSSREFS	`Sequence in context: A133410 A156829 A105840 * A108894 A066794 A087379` `Adjacent sequences: A060424 A060425 A060426 * A060428 A060429 A060430`
	KEYWORD	`nonn,nice`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Apr 05 2001`
	EXTENSIONS	`More terms from Jens Kruse Andersen (jens.k.a(AT)get2net.dk), May 04 2007`

Content is available under The OEIS End-User License Agreement .

Last modified February 11 21:39 EST 2012. Contains 205348 sequences.