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 A385298 #15 Jun 25 2025 17:13:30 %S A385298 0,1,2,3,4,5,6,7,8,9,11,22,33,44,55,66,77,88,90,99,111,222,333,444, %T A385298 555,666,777,888,900,909,990,999,1111,2222,3333,4444,5555,6666,7777, %U A385298 8888,9000,9009,9090,9099,9900,9909,9990,9999,11111,22222,33333,44444,55555,66666,77777,88888,90000,90009 %N A385298 Numbers whose digits all belong to the same residue class mod 9. %H A385298 Alois P. Heinz, <a href="/A385298/b385298.txt">Table of n, a(n) for n = 1..16496</a> (first 200 terms from Stefano Spezia) %t A385298 Select[Range[0,90000],Length[DeleteDuplicates[Mod[IntegerDigits[#],9]]] == 1 &] %Y A385298 Similar sequences for other values of the modulo k: A059708 (k=2), A385292 (k=3), A385293 (k=4), A385294 (k=5), A385295 (k=6), A385296 (k=7), A385297 (k=8), this sequence (k=9). %K A385298 nonn,base,look %O A385298 1,3 %A A385298 _Stefano Spezia_, Jun 24 2025