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.

A188454 Numbers n whose decimal digits are distinct and no digit divides n.

This page as a plain text file.
%I A188454 #18 Apr 25 2025 20:40:49
%S A188454 23,27,29,34,37,38,43,46,47,49,53,54,56,57,58,59,67,68,69,73,74,76,78,
%T A188454 79,83,86,87,89,94,97,98,203,207,209,239,247,249,253,257,259,263,267,
%U A188454 269,283,289,293,307,308,329,346,347,349,356,358,359,367,370,374
%N A188454 Numbers n whose decimal digits are distinct and no digit divides n.
%C A188454 These may not contain 1 or have a 2 or 5 as the last digit. They include prime numbers not containing the digit 1 and composites with a smallest prime factor > 10 and obeying the other constraints (e.g. the largest case is 987654203 = 31*31859813).
%C A188454 The first even case is 34. The first consecutive pair is {37, 38}. {56,57,58,59} is a consecutive quadruple which is the maximal size for such a subset.
%C A188454 There are 202623 terms in this sequence. - _Nathaniel Johnston_, May 19 2011
%H A188454 Nathaniel Johnston, <a href="/A188454/b188454.txt">Table of n, a(n) for n = 1..10000</a>
%t A188454 dddQ[n_]:=Module[{dcn=DigitCount[n]},Max[dcn]==1&&First[dcn]==0 && Union[ Divisible[n,Select[IntegerDigits[n],#!=0&]]]=={False}]; Select[Range[ 400],dddQ] (* _Harvey P. Dale_, May 01 2012 *)
%Y A188454 Cf. A038772, A034709, A034837, A038769, A038770.
%K A188454 nonn,easy,base,fini
%O A188454 1,1
%A A188454 _Andy Edwards_, Mar 31 2011