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.

A317180 a(n) is the least positive multiple of n that contains at least one digit 1 in its decimal representation.

This page as a plain text file.
%I A317180 #11 Apr 09 2022 17:28:42
%S A317180 1,10,12,12,10,12,14,16,18,10,11,12,13,14,15,16,17,18,19,100,21,110,
%T A317180 115,120,100,104,81,112,116,120,31,128,132,102,105,108,111,114,117,
%U A317180 120,41,126,129,132,135,138,141,144,147,100,51,104,106,108,110,112,114
%N A317180 a(n) is the least positive multiple of n that contains at least one digit 1 in its decimal representation.
%H A317180 Rémy Sigrist, <a href="/A317180/b317180.txt">Table of n, a(n) for n = 1..10000</a>
%F A317180 a(n) = n * A317173(n).
%F A317180 a(n) <= A187285(n).
%e A317180 The multiples of 3 are: 3, 6, 9, 12, 15, etc.; 12 is the first one containing the digit 1, hence a(3) = 12.
%t A317180 on1[n_]:=Module[{k=1},While[DigitCount[k*n,10,1]<1,k++];k*n]; Array[on1,60] (* _Harvey P. Dale_, Apr 09 2022 *)
%o A317180 (PARI) a(n) = forstep (m=n, oo, n, if (setsearch(Set(digits(m)), 1), return (m)))
%Y A317180 Cf. A011531, A187285, A317173.
%K A317180 nonn,base
%O A317180 1,2
%A A317180 _Rémy Sigrist_, Jul 23 2018
%E A317180 Definition clarified by _Harvey P. Dale_, Apr 09 2022