1,1

Aurifeuillian primes are when existed as polynomial factor of x^k+1 for some k that after substitution x->2 we are received prime number.

Table of n, a(n) for n=1..27.

a(3)=11 because for k=5 polynomial x^5+1=(x+1)(x^4-x^3+x^2-x+1) and substituting x->2 in (x^4-x^3+x^2-x+1) we have prime number 11.

A061442.

Sequence in context: A227011 A243627 A178604 * A211876 A066587 A047621

Adjacent sequences: A153440 A153441 A153442 * A153444 A153445 A153446

nonn

Artur Jasinski, Dec 26 2008

approved