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.

A104422 Numbers n such that n, p[n], p[n]+n, p[n]-n and p[n]*n all are 2-less.

Original entry on oeis.org

5, 6, 16, 18, 30, 36, 78, 81, 83, 90, 94, 95, 100, 103, 104, 105, 108, 110, 111, 114, 131, 133, 136, 137, 139, 153, 154, 159, 160, 166, 488, 489, 495, 496, 498, 499, 500, 510, 511, 514, 640, 641, 643, 644, 645, 646, 650, 665, 669, 671, 680, 685, 687, 688, 690
Offset: 1

Views

Author

Zak Seidov, Mar 07 2005

Keywords

Comments

From the first 3000 primes, only 182 are such that n, p[n], p[n]+n, p[n]-n and p[n]*n all are 2-less.

Crossrefs

Programs

  • Mathematica
    id[x_]:=IntegerDigits[x];pr[i_]:=Prime[i];ra=Range[3000];A104422=Select[ra, Position[Union[id[ # ], id[pr[ # ]], id[pr[ # ]+# ], id[pr[ # ]-# ], id[pr[ # ]*# ]], 2]=={}&]
    tlQ[n_]:=DigitCount[n,10,2]==0; Select[Range[700],AllTrue[{#,p=Prime[#], p+#,p-#,p*#},tlQ]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, Mar 09 2018 *)