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.

A104421 Numbers n such that n, prime(n), prime(n)+n, prime(n)-n and prime(n)*n all numbers without the digit 1.

This page as a plain text file.
%I A104421 #13 Aug 29 2025 09:57:45
%S A104421 74,75,80,86,87,95,96,350,352,354,355,357,360,364,376,536,557,564,583,
%T A104421 584,590,592,593,594,596,599,600,623,635,639,656,659,660,665,667,674,
%U A104421 677,678,699,700,703,706,707,724,728,734,744,750,759,762,765,766,770
%N A104421 Numbers n such that n, prime(n), prime(n)+n, prime(n)-n and prime(n)*n all numbers without the digit 1.
%C A104421 The graph is of quasi-piecewise linear character.
%C A104421 Any other reasonable function(s) of p and m not having digit 1?
%C A104421 Subsequence of A084368: a(1) = 75 = A084368(36), a(100) = 2744 = A084368(898). - _Zak Seidov_, Dec 04 2013
%H A104421 Zak Seidov, <a href="/A104421/b104421.txt">Table of n, a(n) for n = 1..3000</a>
%e A104421 For n = 74, p = prime(74) = 373, p + n = 447, p - n = 299, p*n = 27602.
%e A104421 For n = 256709, p = prime(256709) = 3599737, p + n = 3856446, p - n = 3343028, p*n = 924084885533.
%t A104421 id[x_]:=IntegerDigits[x]; pr[i_]:=Prime[i]; ra=Range[3000]; A104421=Select[ra, Position[Union[id[ # ], id[pr[ # ]], id[pr[ # ]+# ], id[pr[ # ]-# ], id[pr[ # ]*# ]], 1]=={}&]
%t A104421 prQ[n_]:=With[{p=Prime[n]},AllTrue[IntegerDigits/@{n,p,p+n,p-n,p*n},FreeQ[#,1]&]]; Select[Range[1000],prQ] (* _Harvey P. Dale_, Aug 29 2025 *)
%Y A104421 Cf. A038603, A084368, A104419-A104428.
%K A104421 nonn,base,changed
%O A104421 1,1
%A A104421 _Zak Seidov_, Mar 07 2005