[seqfan] Re: Smallest number as sum of n palindromes
David Wilson
davidwwilson at comcast.net
Sat Dec 17 15:14:21 CET 2016
That's going to be a very fast growing sequence, at least O(c^(2^n)).
> -----Original Message-----
> From: SeqFan [mailto:seqfan-bounces at list.seqfan.eu] On Behalf Of Claudio
> Meller
> Sent: Saturday, December 17, 2016 8:36 AM
> To: Sequence Fanatics Discussion list
> Subject: [seqfan] Smallest number as sum of n palindromes
>
> Hi, yesterday a friend talk to me about the paper "Every natural number is
> the sum of 49 palindromes"
> (https://arxiv.org/pdf/1508.04721.pdf).
>
> Based on this paper I came up with the following sequence " A(n) : Smallest
> number that can be expressed as sum of at least n different palindromes"
>
> A(1) = 0 or 1
> A(2) = 10 (9+1)
> A(3) = 21 (11+9+1)
>
> More terms?
> Is it interesting?
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan
mailing list