[seqfan] Re: Ultra Square Palindromes

[Hans Havermann]

An update from David suggesting a crowdsourced search for anyone willing "with a recent desktop machine equipped with a recent Nvidia graphics card". If that sounds like you, you may reply to David directly. David wrote (to me):

"I don't know whether you have checked out World of Numbers lately, but I enlisted a terrific programmer and computer scientist, Asst. Prof. Robert Xiao at U. British Columbia, to write a state-of-the-art search program for square palindromes and related quadratic palindrome families. Robert and I have now broken virtually all the palindrome length records on Patrick De Geest's site and the record square palindrome has increased from 55 to 62 digits.

The next step we are contemplating for our project would be to crowdsource the search to a community of interested recreational math types with the requisite hardware. Since Robert's program runs on a gpu rather than a cpu, we are looking for folks with a recent desktop machine equipped with a recent Nvidia graphics card. I'm writing to ask whether your Sequence Fanatics friends might include some interested members (e.g., gamers) to help us out."

> On Oct 21, 2022, at 4:03 PM, Hans Havermann <gladhobo at bell.net> wrote:
> 
> David Griffeath is working on a document dealing with "ultra square palindromes", a draft of which may be read here:
> 
> http://chesswanks.com/txt/UltraSquarePalindromes.pdf
> 
> Relevant sequences are:
> https://oeis.org/A002778
> https://oeis.org/A002779
> 
> My own 1940-term b-files for these were added in 2014 based solely on the 2002 calculations of Feng Yuan. David feels that 20 years later, one should be able to do much better. I've CC'd David herewith. If you can help answer some of the issues presented at the end of his pdf, you may contact him directly. Of course larger b-files are welcome.