A246809 Composite numbers such that n^(b^n) == (-1)^b (mod C_b(n)), where C_b(n) = n*b^n+1 (A210339).

12801, 136497879001, 422240040001, 18677955240001

Offset: 1

Author

Felix Fröhlich, Nov 16 2014

Keywords

• nonn
• hard
• more

Links

• J. M. Grau and A. M. Oller-Marcen, An O(log^2(N)) time primality test for generalized Cullen numbers, Math. Comp., Vol. 80, Num. 276 (2011), 2315-2323.

Crossrefs

Cf. A210339.