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 A385297 #16 Jun 25 2025 17:07:43 %S A385297 0,1,2,3,4,5,6,7,8,9,11,19,22,33,44,55,66,77,80,88,91,99,111,119,191, %T A385297 199,222,333,444,555,666,777,800,808,880,888,911,919,991,999,1111, %U A385297 1119,1191,1199,1911,1919,1991,1999,2222,3333,4444,5555,6666,7777,8000,8008,8080,8088,8800,8808,8880,8888 %N A385297 Numbers whose digits all belong to the same residue class mod 8. %H A385297 Alois P. Heinz, <a href="/A385297/b385297.txt">Table of n, a(n) for n = 1..12358</a> (first 1000 terms from Stefano Spezia) %t A385297 Select[Range[0,9000],Length[DeleteDuplicates[Mod[IntegerDigits[#],8]]] == 1 &] %Y A385297 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), this sequence (k=8), A385298 (k=9). %K A385297 nonn,base,look %O A385297 1,3 %A A385297 _Stefano Spezia_, Jun 24 2025