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 A377948 #17 Jun 21 2025 19:58:53 %S A377948 11,22,33,44,55,66,77,88,99,111,112,113,114,115,116,117,118,119,122, %T A377948 133,144,155,166,177,188,199,222,223,224,225,226,227,228,229,233,244, %U A377948 255,266,277,288,299,333,334,335,336,337,338,339,344,355,366,377,388,399 %N A377948 Numbers that have at least 1 repeated decimal digit and whose decimal digits are nondecreasing as place value decreases. %C A377948 Intersection of A009994 and A109303. %C A377948 Does not intersect either A009993 or A009995. %H A377948 Michael De Vlieger, <a href="/A377948/b377948.txt">Table of n, a(n) for n = 1..10938</a> (includes all numbers up to 7 digits long) %F A377948 A178788(a(n)) = 0. %t A377948 Select[Range[10^6], And[CountDistinct[#] != Length[#], AllTrue[Differences[#], # >= 0 &]] &[IntegerDigits[#]] &] %t A377948 (* More efficient program: *) %t A377948 b = 10; mm = b - 1; nn = 14; %t A377948 s = Table[Map[Position[#, 1][[All, 1]] &, %t A377948 Permutations@ Join[ConstantArray[1, r], ConstantArray[0, mm - r] ] ], %t A377948 {r, Min[mm, nn]}]; %t A377948 Union@ Flatten@ Table[ %t A377948 w = Apply[Join, Permutations /@ IntegerPartitions[n, Min[mm, n - 1] ] ]; %t A377948 Reap[Do[ %t A377948 Sow[Table[FromDigits[Flatten@ %t A377948 MapIndexed[ConstantArray[m[[First[#2] ]], #1] &, %t A377948 w[[i]]], b], {m, s[[Length[w[[i]]] ]]} ] ], %t A377948 {i, Length[w]}] ][[-1, 1]], {n, 2, nn}] %Y A377948 Cf. A009993, A009994, A009995, A109303, A178788. %K A377948 nonn,base,easy %O A377948 1,1 %A A377948 _Michael De Vlieger_, Nov 14 2024