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.

A373899 Semiprimes q*p such that q^p == p (mod (q - p)), where q > p.

Original entry on oeis.org

6, 15, 21, 33, 35, 55, 65, 77, 85, 91, 133, 143, 145, 155, 161, 187, 209, 217, 221, 247, 253, 265, 299, 301, 323, 341, 377, 391, 403, 415, 437, 451, 481, 493, 533, 545, 551, 553, 559, 581, 589, 611, 629, 667, 671, 689, 697, 703, 713, 781, 793, 799, 817, 893, 899, 901
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Jun 22 2024

Keywords

Examples

			15 = 3*5 is a term because 5^3 == 3 (mod 2).
		

Crossrefs

Subsequence of A001358.
Cf. A037074 (subsequence), A046388, A371811.

Programs

  • Mathematica
    seqQ[n_] := Module[{f = FactorInteger[n], p, q}, If[f[[;; , 2]] == {1, 1}, p = f[[1, 1]]; q = f[[2, 1]]; PowerMod[q, p, q - p] == Mod[p, q - p], False]]; Select[Range[1000], seqQ] (* Amiram Eldar, Jun 26 2024 *)