cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A333131 Super pseudoprimes to both bases 2 and 3 (A333130) with more than two prime factors (counted with multiplicity).

Original entry on oeis.org

11500521553, 13079177569, 52474339009, 168003672409, 229352039821, 280792563977, 318289021201, 428178002569, 918660756421, 2015841188197, 2367478228501, 2544457029601, 2639665216117, 3023595814801, 3457449931321, 3712164285421, 4348114583017, 6046196043229
Offset: 1

Views

Author

Amiram Eldar, Mar 08 2020

Keywords

Comments

Up to 2^64 all the 1085 terms are nonsquarefree, 2 terms have 4 prime factors: a(163) = 18362297383286473 = 3037 * 6073 * 9109 * 109297 and a(651) = 2587580959818925201 = 18121 * 36241 * 54361 * 72481, and no term have more than 4 prime factors.

Examples

			11500521553 is a term since it is a Fermat pseudoprime to both bases 2 and 3, and its proper divisors that are larger than 1 are either primes (937, 1873, 6553) or Fermat pseudoprimes to both bases 2 and 3 (1755001, 6140161, 12273769, 11500521553).
		

Crossrefs

Programs

  • Mathematica
    pspQ[n_] := PrimeOmega[n] > 2 && AllTrue[Rest @ Divisors[n], PowerMod[2, # - 1, #] == 1 && PowerMod[3, # - 1, #] == 1 &]; seq = {}; Do[If[pspQ[n], AppendTo[seq, n]], {n, 1, 6*10^10}]; seq