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 A227238 #26 Jul 10 2022 13:22:33
%S A227238 17,25,33,41,49,57,65,73,89,97,105,113,121,129,137,145,153,169,177,
%T A227238 185,193,201,209,217,225,249,257,265,273,281,289,297,329,337,345,353,
%U A227238 361,369,409,417,425,433,441,489,497,505,513,569,577,585,649,657,737,745
%N A227238 Numbers whose base-9 sum of digits is 9.
%C A227238 All of the entries are odd.
%C A227238 Subsequence of A017077. - _Michel Marcus_, Sep 02 2013
%C A227238 In general, the set of numbers with sum of base-b digits equal to b is a subset of { (b-1)*k + 1; k = 2, 3, 4, ... }. - _M. F. Hasler_, Dec 23 2016
%H A227238 Michael S. Branicky, <a href="/A227238/b227238.txt">Table of n, a(n) for n = 1..10000</a>
%e A227238 The 9-ary expansion of 17 is (1,8), which has sum of digits 9.
%e A227238 The 9-ary expansion of 169 is (2,0,7), which has sum of digits 9.
%e A227238 10 is not on the list since the 9-ary expansion of 10 is (1,1), which has sum of digits 2 not 9.
%t A227238 Select[Range@ 750, Total@ IntegerDigits[#, 9] == 9 &] (* _Michael De Vlieger_, Dec 23 2016 *)
%o A227238 (Sage) [i for i in [0..1000] if sum(Integer(i).digits(base=9))==9]
%o A227238 (PARI) select( is(n)=sumdigits(n,9)==9, [1..999]) \\ _M. F. Hasler_, Dec 23 2016
%o A227238 (Python)
%o A227238 agen = A226636gen(sod=9, base=9) # generator of terms using code in A226636
%o A227238 print([next(agen) for n in range(1, 55)]) # _Michael S. Branicky_, Jul 10 2022
%Y A227238 Cf. A018900, A187813.
%Y A227238 Cf. A226636 (b = 3), A226969 (b = 4), A227062 (b = 5), A227080 (b = 6), A227092 (b = 7), A227095 (b = 8), A227238 (b = 9), A052224 (b = 10).
%K A227238 nonn,base,easy
%O A227238 1,1
%A A227238 _Tom Edgar_, Sep 01 2013