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.

A243825 Numbers n such that every divisor greater than 1 contains the digit 0.

This page as a plain text file.
%I A243825 #23 Sep 08 2022 08:46:08
%S A243825 101,103,107,109,307,401,409,503,509,601,607,701,709,809,907,1009,
%T A243825 1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,
%U A243825 1093,1097,1103,1109,1201,1301,1303,1307,1409,1601,1607,1609,1709,1801,1901,1907,2003,2011,2017,2027,2029
%N A243825 Numbers n such that every divisor greater than 1 contains the digit 0.
%C A243825 This is an example of a composite number in the sequence which demonstrates that A056709 is a proper subsequence. - _R. J. Mathar_, Jun 13 2014
%H A243825 Amiram Eldar, <a href="/A243825/b243825.txt">Table of n, a(n) for n = 1..10000</a>
%e A243825 The divisors of 10201 are {1, 101 & 10201}. Except for 1 each has a 0 in its decimal expansion.
%t A243825 fQ[n_, dgt_] := Union[ MemberQ[#, dgt] & /@ IntegerDigits@ Rest@ Divisors@ n][[1]]; Select[ Range[2, 2030], fQ[#, 0] &]
%o A243825 (Magma) [m:m in [2..2100] |  #[d:d in Divisors(m)|0 in Intseq(d)] eq #Divisors(m)-1]; // _Marius A. Burtea_, Nov 08 2019
%Y A243825 Cf. A062634, A062653, A062667, A062669, A062671, A062673, A062675, A062677, A062679.
%Y A243825 Supersequence of A056709 (primes) and A243819 (composites).
%K A243825 nonn,base,easy
%O A243825 1,1
%A A243825 Barbara W. Waddell and _Robert G. Wilson v_, Jun 11 2014