login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A246809 Composite numbers such that n^(b^n) == (-1)^b (mod C_b(n)), where C_b(n) = n*b^n+1 (A210339). 0
12801, 136497879001, 422240040001, 18677955240001 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

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.

Sequence in context: A157509 A035916 A243050 * A204490 A218457 A251053

Adjacent sequences:  A246806 A246807 A246808 * A246810 A246811 A246812

KEYWORD

nonn,hard,more

AUTHOR

Felix Fröhlich, Nov 16 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 29 05:41 EDT 2022. Contains 354122 sequences. (Running on oeis4.)