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 A385293 #15 Jun 25 2025 17:20:56 %S A385293 0,1,2,3,4,5,6,7,8,9,11,15,19,22,26,33,37,40,44,48,51,55,59,62,66,73, %T A385293 77,80,84,88,91,95,99,111,115,119,151,155,159,191,195,199,222,226,262, %U A385293 266,333,337,373,377,400,404,408,440,444,448,480,484,488,511,515,519,551,555,559,591,595,599 %N A385293 Numbers whose digits all belong to the same residue class mod 4. %H A385293 Stefano Spezia, <a href="/A385293/b385293.txt">Table of n, a(n) for n = 1..10000</a> %t A385293 Select[Range[0,600],Length[DeleteDuplicates[Mod[IntegerDigits[#],4]]] == 1 &] %Y A385293 Similar sequences for other values of the modulo k: A059708 (k=2), A385292 (k=3), this sequence (k=4), A385294 (k=5), A385295 (k=6), A385296 (k=7), A385297 (k=8), A385298 (k=9). %K A385293 nonn,base,easy,look %O A385293 1,3 %A A385293 _Stefano Spezia_, Jun 24 2025