A145294 - OEIS

This site is supported by donations to The OEIS Foundation.

A145294

a(n) = smallest x such that Euler polynomial x^2 + x + 41 has the n power of a prime as divisor.

40, 1721, 14144, 2294005 (list; graph; refs; listen; history; internal format)

	OFFSET	`2,1`
	COMMENTS	`Euler polynomial is giving primes for consecutive x from 0 to 39.` `Numbers x for which x^2 + x + 41 is not prime see A007634.` `Composite numbers of the form x^2 + x + 41 see A145292.` `Smallest x such that polynomial x2 + x + 41 have exactly n distinct prime divisors see A145293.`
	EXAMPLE	`a(2)=40 because when x=40 than x^2+x+41=1681=41^2 a(3)=1721 because when x=1721 than x^2+x+41=2963603=4341^3 a(4)=14144 because when x=14144 than x^2+x+41=200066921=4147^4 a(5)=2294005 because when x=2294005 than x^2+x+41=5262461234071=35797*43^5`
	CROSSREFS	`A005846, A007634, A145292, A145294, A145295` `Sequence in context: A009984 A041761 A140702 * A147520 A190926 A143314` `Adjacent sequences: A145291 A145292 A145293 * A145295 A145296 A145297`
	KEYWORD	`nonn`
	AUTHOR	`Artur Jasinski (grafix(AT)csl.pl), Oct 07 2008`

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

Last modified February 17 16:13 EST 2012. Contains 206050 sequences.