Palindromes in a base less than the square root

[David Wilson]

I've spent some time with A016038, and I still think it is infinite,
but a proof is beyond me.  So I'm going to drop the investigation
for now.

----- Original Message ----- 
From: "Dr. Gordon Hamilton" <hamiltonian at shaw.ca>
To: <ham>; <seqfan at ext.jussieu.fr>
Sent: Tuesday, March 01, 2005 9:56 PM
Subject: Palindromes in a base less than the square root


> A100563 reports the number of times that a number is a palindrome in a 
> base less than its square root.
>
> For example 100 is a palindrome in bases 3, 7, and 9 so F(100) =3.
>
> Are there an infinite number of "unkempt" numbers with F(n) = 0 ?
>
> Thanks for any insight...
>
> Gordon
>
>
> -- 
> No virus found in this outgoing message.
> Checked by AVG Anti-Virus.
> Version: 7.0.300 / Virus Database: 266.5.2 - Release Date: 28/02/2005
>