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 A385292 #18 Jun 25 2025 11:38:48 %S A385292 0,1,2,3,4,5,6,7,8,9,11,14,17,22,25,28,30,33,36,39,41,44,47,52,55,58, %T A385292 60,63,66,69,71,74,77,82,85,88,90,93,96,99,111,114,117,141,144,147, %U A385292 171,174,177,222,225,228,252,255,258,282,285,288,300,303,306,309,330,333,336,339,360,363,366 %N A385292 Numbers whose digits all belong to the same residue class mod 3. %H A385292 Stefano Spezia, <a href="/A385292/b385292.txt">Table of n, a(n) for n = 1..10000</a> %t A385292 Select[Range[0,366],Length[DeleteDuplicates[Mod[IntegerDigits[#],3]]] == 1 &] %Y A385292 Similar sequences for other values of the modulo k: A059708 (k=2), this sequence (k=3), A385293 (k=4), A385294 (k=5), A385295 (k=6), A385296 (k=7), A385297 (k=8), A385298 (k=9). %K A385292 nonn,base,easy,look %O A385292 1,3 %A A385292 _Stefano Spezia_, Jun 24 2025