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.

A029562 Quasi-Carmichael numbers to base -2: squarefree composites n such that for every prime p that divides n, p+2 divides n+2.

Original entry on oeis.org

598, 3913, 11590, 32578, 91078, 95170, 154843, 179998, 301273, 317623, 668743, 1742830, 1806673, 2486482, 2517226, 4543423, 5013853, 5237230, 6360523, 6704773, 7342162, 8810503, 10775833, 12858118, 16650478, 18183823, 19230433, 21381358
Offset: 1

Views

Author

Keywords

Programs

  • Mathematica
    qcp[n_, d_] := Block[{p, e}, {p, e} = Transpose@FactorInteger@n;
    Length[p] > 1 && Max[e] == 1 && And @@ IntegerQ /@ ((n + d)/(p + d))]; Select[Range[10^6], qcp[#, 2] &] (* Giovanni Resta, May 21 2013 *)