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 A227092 #35 Jul 10 2022 11:36:06
%S A227092 13,19,25,31,37,43,55,61,67,73,79,85,91,103,109,115,121,127,133,151,
%T A227092 157,163,169,175,199,205,211,217,247,253,259,295,301,349,355,361,367,
%U A227092 373,379,385,397,403,409,415,421,427,445,451,457,463,469,493,499,505
%N A227092 Numbers whose base-7 sum of digits is 7.
%C A227092 All of the entries are odd.
%C A227092 Subsequence of A016921. - _Michel Marcus_, Sep 03 2013
%C A227092 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 A227092 Michael S. Branicky, <a href="/A227092/b227092.txt">Table of n, a(n) for n = 1..10000</a>
%e A227092 The 7-ary expansion of 13 is (1,6), which has sum of digits 7.
%e A227092 The 7-ary expansion of 103 is (2,0,5), which has sum of digits 7.
%e A227092 10 is not on the list since the 7-ary expansion of 10 is (1,3), which has sum of digits 4 not 7.
%t A227092 Select[Range[600],Total[IntegerDigits[#,7]]==7&] (* _Harvey P. Dale_, Aug 18 2014 *)
%o A227092 (Sage) [i for i in [0..1000] if sum(Integer(i).digits(base=7))==7]
%o A227092 (PARI) select( is(n)=sumdigits(n,7)==7, [1..999]) \\ _M. F. Hasler_, Dec 23 2016
%o A227092 (Python)
%o A227092 agen = A226636gen(sod=7, base=7) # generator of terms using code in A226636
%o A227092 print([next(agen) for n in range(1, 55)]) # _Michael S. Branicky_, Jul 10 2022
%Y A227092 Cf. A018900, A187813.
%Y A227092 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 A227092 nonn,base
%O A227092 1,1
%A A227092 _Tom Edgar_, Sep 01 2013