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 A280823 #13 Feb 16 2025 08:33:39
%S A280823 0,1,2,3,4,5,6,7,8,9,102,103,104,105,106,107,108,109,111,120,123,124,
%T A280823 125,126,127,128,129,130,132,134,135,136,137,138,139,140,142,143,145,
%U A280823 146,147,148,149,150,152,153,154,156,157,158,159,160,162,163,164,165,167,168,169,170,172,173,174,175,176,178,179,180
%N A280823 Numbers with an odd number of digits and with an odd number of distinct digits.
%H A280823 Harvey P. Dale, <a href="/A280823/b280823.txt">Table of n, a(n) for n = 1..1000</a>
%H A280823 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Digit.html">Digit</a>
%H A280823 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%F A280823 A000035(A055642(a(n))) = 1.
%F A280823 A000035(A043537(a(n))) = 1.
%t A280823 Select[Range[0, 180], Mod[Length[IntegerDigits[#1]], 2] == 1 && Mod[Length[Union[IntegerDigits[#1]]], 2] == 1 & ]
%t A280823 Join[{0},Select[Range[200],AllTrue[{IntegerLength[#],Count[DigitCount[#],_?(#>0&)]},OddQ]&]] (* _Harvey P. Dale_, Dec 16 2023 *)
%Y A280823 Cf. A000035, A001633, A043537, A055642, A280824, A280825, A280826.
%K A280823 nonn,base,easy
%O A280823 1,3
%A A280823 _Ilya Gutkovskiy_, Jan 08 2017