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 A130604 #11 Apr 23 2023 02:15:36
%S A130604 0,1,2,3,4,5,6,23,46,265,316,1030,1234,1366,1431,1454,2060,2116,10144,
%T A130604 10342,10542,11425,12415,12450,12564,12651,13045,13245,13534,14610,
%U A130604 15226,15643,16255,16546,16633,101046,101264,102615,103260,103316,103460,103461,103462,103463,103464,103465,103466,104126,104632,104650,104651,104652,104653,104654,104655,104656,105266,106235,106253,113256,116336
%N A130604 Numbers whose base-10 and base-7 representations are permutations of the same multiset of digits.
%C A130604 The sequence is finite and full since any d-digit number is < 7^d in base 7 and > 10^(d-1) in base 10. But 1000000 = 10^6 > 7^7 = 823543, so any term must have 6 or fewer digits and all those are present. - _Michael S. Branicky_, Apr 22 2023
%e A130604 14610 is represented as 14610 in base 10 and as 60411 in base 7. Each representation is a permutation of the multiset {0,1,1,4,6}.
%t A130604 Select[Range[10,110000],Sort[IntegerDigits[#]]==Sort[IntegerDigits[#,7]]&] (* _Harvey P. Dale_, Sep 23 2017 *)
%o A130604 (Python)
%o A130604 from sympy.ntheory import digits
%o A130604 def ok(n): return sorted(map(int, str(n))) == sorted(digits(n, 7)[1:])
%o A130604 print([k for k in range(10**6) if ok(k)]) # _Michael S. Branicky_, Apr 22 2023
%Y A130604 Cf. A037440, A074233.
%K A130604 nonn,base,fini,full
%O A130604 1,3
%A A130604 _Paul Lusch_, Aug 10 2007
%E A130604 a(1)-a(7) inserted and a(43)-a(61) from _Michael S. Branicky_, Apr 22 2023