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 A037327 #34 Apr 11 2023 08:45:57
%S A037327 1,2,3,4,5,66,67,68,69,126,127,128,129,130,131,156,157,158,159,160,
%T A037327 189,190,191,246,247,248,249,250,251,280,281,308,309,310,311,366,367,
%U A037327 368,369,370,396,397,398,456,457,458,459,460,461,518,519,520,521,546,547
%N A037327 Numbers whose base-6 and base-7 expansions have the same digit sum.
%F A037327 {n: A053827(n) = A053828(n)}. - _R. J. Mathar_, Jun 30 2021
%o A037327 (PARI) isok(k) = sumdigits(k, 6) == sumdigits(k, 7); \\ _Michel Marcus_, Mar 18 2023
%o A037327 (Python)
%o A037327 from numpy import base_repr
%o A037327 def ok(n):
%o A037327 return sum(map(int, base_repr(n, 6))) == sum(map(int, base_repr(n, 7)))
%o A037327 print([n for n in range(1, 10**5) if ok(n)])
%o A037327 # _Christoph B. Kassir_, Apr 05 2023
%Y A037327 Cf. A053827, A053828.
%K A037327 nonn,base
%O A037327 1,2
%A A037327 _Clark Kimberling_