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.
%I A352317 #19 May 25 2022 10:05:33
%S A352317 3,9,10,12,18,19,21,27,28,30,36,37,39,45,46,48,54,55,57,63,64,66,72,
%T A352317 73,75,81,82,84,90,91,93,99,100,102,108,109,111,117,118,120,126,127,
%U A352317 129,135,136,138,144,145,147,153,154,156,162,163,165,171,172,174,180,181,183,189,190,192,198,199
%N A352317 Numbers m such that A352688(m) = 1.
%C A352317 Equivalently: numbers m such that the sum of digits (A007953) of the integers from 1 to A331786(m) is not divisible by m.
%C A352317 Numbers m such that the first run of A331786(m) consecutive numbers whose sum of digits (A007953) is not divisible by m begins at 1.
%C A352317 A331786(m) is the largest possible number of consecutive integers whose sum of digits is not divisible by m.
%C A352317 For this sequence here, A352689(m) = A331786(m).
%H A352317 Diophante, <a href="http://www.diophante.fr/problemes-par-themes/arithmetique-et-algebre/a3-nombres-remarquables/5026-a389-les-decaxphobes">A389 - Les décaXphobes</a> (in French).
%e A352317 For m = 10, the sum of digits of the integers from 1 up to A331786(10) = 18 is not divisible by 10; then for 19, sod(19) = 10 is divisible by 10, hence 10 is a term.
%o A352317 (PARI) a88(n) = my(t=gcd(n%9, 9)); if(t<9, 10^lift(Mod(-1, n/t)/(9/t)) - 10^(n\9)*(n%9-t+1) + 1, 1); \\ A352688
%o A352317 isok(m) = a88(m) == 1; \\ _Michel Marcus_, Apr 15 2022
%Y A352317 Cf. A007953, A331786, A352688, A352689.
%Y A352317 A008591 \ {0} and A017173 \ {1} are subsequences.
%K A352317 nonn,base
%O A352317 1,1
%A A352317 _Bernard Schott_, Apr 14 2022
%E A352317 More terms from _Michel Marcus_, Apr 15 2022