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 A037465 #27 May 07 2025 11:32:13
%S A037465 0,1,2,3,4,6,7,8,9,10,12,13,14,15,16,18,19,20,21,22,24,25,26,27,28,36,
%T A037465 37,38,39,40,42,43,44,45,46,48,49,50,51,52,54,55,56,57,58,60,61,62,63,
%U A037465 64,72,73,74,75,76,78,79,80,81,82,84,85,86,87,88,90,91,92,93
%N A037465 a(n) = Sum_{i=0..m} d(i)*6^i, where Sum_{i=0..m} d(i)*5^i is the base 5 representation of n.
%C A037465 Numbers without digit 5 in base 6. Complement of A333656. - _François Marques_, Oct 13 2020
%H A037465 François Marques, <a href="/A037465/b037465.txt">Table of n, a(n) for n = 0..10000</a> (first 1000 terms from Clark Kimberling)
%e A037465 a(34)=46 because 34 is 114_5 in base 5 and 114_6=46. - _François Marques_, Oct 13 2020
%t A037465 Table[FromDigits[RealDigits[n, 5], 6], {n, 0, 100}] (* _Clark Kimberling_, Aug 14 2012 *)
%o A037465 (PARI) a(n) = fromdigits(digits(n, 5), 6); \\ _François Marques_, Oct 13 2020
%o A037465 (Python)
%o A037465 from gmpy2 import digits
%o A037465 def A037465(n): return int(digits(n,5),6) # _Chai Wah Wu_, May 06 2025
%Y A037465 Cf. Numbers with at least one digit b-1 in base b : A074940 (b=3), A337250 (b=4), A337572 (b=5), A333656 (b=6), A337141 (b=7), A337239 (b=8), A338090 (b=9), A011539 (b=10), A095778 (b=11).
%Y A037465 Cf. Numbers with no digit b-1 in base b: A005836 (b=3), A023717 (b=4), A020654 (b=5), this sequence (b=6), A020657 (b=7), A037474 (b=8), A037477 (b=9), A007095 (b=10), A171397 (b=11).
%K A037465 nonn,base,easy
%O A037465 0,3
%A A037465 _Clark Kimberling_
%E A037465 Offset changed to 0 by _Clark Kimberling_, Aug 14 2012