[seqfan] Re: How many terms?
Jack Brennen
jfb at brennen.net
Mon Dec 8 11:36:03 CET 2014
Best I have found with a quick C program is 46 terms. The first such
sequence lexicographically is:
123 124 125 126 127 134 135 136 137 138 139 142 143 146 147 148 149 153
156 157 158 159 164 168 169 175 176 182 183 184 185 186 192 193 194 195
196 197 198 207 214 215 216 217 218 219
Jack
On 12/8/2014 9:46 AM, Frank Adams-Watters wrote:
> 3,6,12,13,14,15,16,... goes 30.
>
> Franklin T. Adams-Watters
>
> -----Original Message-----
> From: Eric Angelini <Eric.Angelini at kntv.be>
> To: Sequence Discussion list <seqfan at list.seqfan.eu>
> Sent: Mon, Dec 8, 2014 3:02 am
> Subject: [seqfan] How many terms?
>
>
>
> Hello SeqFans,
> How many terms could the longest such sequence S contain?
> 1) No term of S has a repeated digit (ex. 232 is forbidden)
> 2) a(n+1)=a(n)+[one digit of a(n)]
> 3) a(n+1)>a(n)
>
> This S has 28 terms, for instance, and is impossible to extend:
>
> S=1,2,4,8,16,17,18,19,28,36,39,42,46,52,54,58,63,69,75,82,84,92,94,98,106
> ,107,108,109.
>
> Start S' with any integer and try to beat 28.
> Best,
> É.
>
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>
>
>
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>
>
>
More information about the SeqFan
mailing list