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!)
A270840 Numbers n such that n^3 + 1 is a 2-pseudoprime (or Sarrus number). 2
12, 36, 138, 270, 546, 4800, 7560, 12840, 14700, 358200, 678480, 16139970, 22934100, 55058580, 59553720, 74371320, 113068380, 116605860, 242699310, 997521210, 1592680320, 1652749200, 3190927740, 5088964800, 6974736756, 9214178820 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Since n^3 + 1 is clearly composite (n>1), this is n such that 2^(n^3) == 1 (mod n^3+1).
There is only one n such that n + 1 is a composite number up to 10^10: 14700. - Altug Alkan, Mar 27 2016
LINKS
FORMULA
a(n) = A265653(n) - 1. - Altug Alkan, Mar 24 2016
PROG
(PARI) is(n)=Mod(2, n^3+1)^(n^3)==1
CROSSREFS
Sequence in context: A355386 A073403 A191817 * A064518 A238923 A135178
KEYWORD
nonn
AUTHOR
Jeppe Stig Nielsen, Mar 23 2016
EXTENSIONS
More terms from Altug Alkan, Mar 24 2016
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 April 19 16:52 EDT 2024. Contains 371794 sequences. (Running on oeis4.)