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 A329420 #9 Nov 29 2019 18:23:55
%S A329420 1,3,9,15,45,189,765,48573,196605,3183328701,12884901885
%N A329420 Numbers all of whose divisors are binary palindromes (A329419) with a record number of divisors.
%C A329420 A number m is in this sequence if it is in A329419, and d(m) > d(k) for all terms k < m in A329419, where d(m) is the number of divisors of m (A000005).
%C A329420 The corresponding record numbers of divisors are 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, ...
%C A329420 Apparently, the record values are the only values of the number of divisors of the terms of A329419 (checked for all the terms of A329419 below a(11)).
%t A329420 binPalQ[n_] := PalindromeQ @ IntegerDigits[n, 2];
%t A329420 binAllDivPalQ[n_] := binPalQ[n] && AllTrue[Most @ Divisors[n], binPalQ];
%t A329420 divNumMax = 0; seq={}; Do[If[binAllDivPalQ[n] && (divNum = DivisorSigma[0, n]) > divNumMax, divNumMax = divNum; AppendTo[seq, n]],{n, 1, 2*10^5}]; seq
%Y A329420 Subsequence of A006995 and A329419.
%Y A329420 Cf. A000005.
%K A329420 nonn,more
%O A329420 1,2
%A A329420 _Amiram Eldar_, Nov 29 2019