login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A331897
Positive numbers all of whose divisors are negabinary palindromes (A331891) with a record number of divisors.
0
1, 3, 21, 5397, 353703189
OFFSET
1,2
COMMENTS
A number m is in this sequence if it is in A331896, and d(m) > d(k) for all terms k < m in A331896, where d(m) is the number of divisors of m (A000005).
The corresponding number of divisors are 1, 2, 4, 8, 16, ...
Apparently the terms are squarefree products of Mersenne primes (A000668) and Fermat primes (A019434).
a(6) <= 3301173437325733061894777515.
EXAMPLE
21 is a term since all the divisors of 21, {1, 3, 7, 21}, are palindromes in negabinary representation: {1, 111, 11011, 10101}, and it has 4 divisors, more than the number of divisors of smaller numbers with this property: 1, 3, 5, 7, 11, and 17 have no more than 2 divisors.
MATHEMATICA
negabin[n_] := negabin[n] = If[n==0, 0, negabin[Quotient[n-1, -2]]*10 + Mod[n, 2]];
negaBinPalQ[n_] := PalindromeQ[negabin[n]];
negaBinAllDivPalQ[n_] := negaBinPalQ[n] && AllTrue[Most @ Divisors[n], negaBinPalQ];
divNumMax = 0; seq={}; Do[If[negaBinAllDivPalQ[n] && (divNum = DivisorSigma[0, n]) > divNumMax, divNumMax = divNum; AppendTo[seq, n]], {n, 1, 6000}]; seq
CROSSREFS
KEYWORD
nonn,base,more
AUTHOR
Amiram Eldar, Jan 30 2020
STATUS
approved