id:A089132 - OEIS Search Results

Search: id:A089132

Displaying 1-1 of 1 results found.

page 1

First prime in the progression (n!+m)/m.

+0
1

2, 2, 3, 2, 2, 2, 103, 631, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 5, 5, 5, 5, 5, 5, 163, 23, 10778406912001, 149, 1153, 100801, 137, 19, 19, 19, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`m=n=200 in Pari program. It appears that for any base m there is an infinity of primes in the progression.`
	PROGRAM	`(PARI) nfactp2d2(n, m) = { for(k=1, m, for(x=1, n, y=floor((x!+ k)/k); if(isprime(y), print1(y", "); break) ) ) }`
	CROSSREFS	`Adjacent sequences: A089129 A089130 A089131 this_sequence A089133 A089134 A089135` `Sequence in context: A085962 A060244 A067132 this_sequence A107259 A121041 A003589`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Cino Hilliard (hillcino368(AT)gmail.com), Dec 05 2003`

page 1

Search completed in 0.002 seconds

Last modified October 6 16:13 EDT 2008. Contains 144667 sequences.

AT&T Labs Research