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 A227095 #27 Jul 10 2022 11:36:59
%S A227095 15,22,29,36,43,50,57,71,78,85,92,99,106,113,120,134,141,148,155,162,
%T A227095 169,176,197,204,211,218,225,232,260,267,274,281,288,323,330,337,344,
%U A227095 386,393,400,449,456,519,526,533,540,547,554,561,568,582,589,596,603
%N A227095 Numbers whose base-8 sum of digits is 8.
%C A227095 Subsequence of A016993. - _Michel Marcus_, Sep 03 2013
%C A227095 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 A227095 Michael S. Branicky, <a href="/A227095/b227095.txt">Table of n, a(n) for n = 1..10000</a>
%e A227095 The 8-ary expansion of 15 is (1,7), which has sum of digits 8.
%e A227095 The 8-ary expansion of 78 is (1,1,6), which has sum of digits 8.
%e A227095 10 is not on the list since the 8-ary expansion of 10 is (1,2), which has sum of digits 3 not 8.
%t A227095 Select[Range@ 603, Total@ IntegerDigits[#, 8] == 8 &] (* _Michael De Vlieger_, Dec 23 2016 *)
%o A227095 (Sage) [i for i in [0..1000] if sum(Integer(i).digits(base=8))==8]
%o A227095 (PARI) select( is(n)=sumdigits(n,8)==8, [1..999]) \\ _M. F. Hasler_, Dec 23 2016
%o A227095 (Python)
%o A227095 agen = A226636gen(sod=8, base=8) # generator of terms using code in A226636
%o A227095 print([next(agen) for n in range(1, 55)]) # _Michael S. Branicky_, Jul 10 2022
%Y A227095 Cf. A018900, A187813.
%Y A227095 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 A227095 nonn,base
%O A227095 1,1
%A A227095 _Tom Edgar_, Sep 01 2013