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.

This page as a plain text file.
%I A104422 #5 Mar 09 2018 17:12:13
%S A104422 5,6,16,18,30,36,78,81,83,90,94,95,100,103,104,105,108,110,111,114,
%T A104422 131,133,136,137,139,153,154,159,160,166,488,489,495,496,498,499,500,
%U A104422 510,511,514,640,641,643,644,645,646,650,665,669,671,680,685,687,688,690
%N A104422 Numbers n such that n, p[n], p[n]+n, p[n]-n and p[n]*n all are 2-less.
%C A104422 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.
%H A104422 Harvey P. Dale, <a href="/A104422/b104422.txt">Table of n, a(n) for n = 1..1000</a>
%t A104422 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]=={}&]
%t A104422 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 *)
%Y A104422 Cf. A104419-A104428.
%K A104422 nonn,base
%O A104422 1,1
%A A104422 _Zak Seidov_, Mar 07 2005