---

Claim. P. Pollack, Palindromic sums of proper divisors, Integers 15A (2015), article A13, Theorem 1: "Fix $g\geq2$. Let $k$ be an integer with $k\geq2$. The upper density of those $n$ for which $s(n)$ is $k$-nearly-palindromic is $O_g(1/\log k)$." Every base-$g$ palindrome is $k$-nearly-palindromic for every $k$, so the $n$ with $s(n)$ a base-$g$ palindrome have density zero (card), the assertion of Problem 955 for the palindromes, a set with about $x^{1/2}$ elements up to $x$. The paper prints its received and accepted dates and the publication date 15 June 2015, the date this page carries.

Covers. The instance $A$ = the base-$g$ palindromes, for each $g\ge2$; the general assertion stays open.

Depends on. No page of this wiki.

Acceptance. Claimed. Volume 15A of Integers is the proceedings of Integers 2013, the Erdős Centennial Conference, and no record of the volume's refereeing is on file, so refereed is not listed. The site does not credit the paper.