[seqfan] Re: seqs whose |differences| are 1,2,3,4,...

[Ron Hardin]

It changes hourly, but brute force search, taking the a(n)-n choice before the a(n)+n choice, and limiting the seach ahead by an amount call-it L,
gives an increasing run of reached integers vs L.

At the moment, this reaches all integers up to top=57
1 2 4 7 3 8 14 21 13 22 12 23 11 24 10 25 9 26 44 63 43 64 42 65 41 66 40 67 39 68 38 69 37 70 36 71 35 72 34 73 33 74 32 75 31 76 30 77 29 78 28 79 27 80 134 189 133 190 132 191 131 192 130 193 129 194 128 195 127 196 266 337 409 336 410 335 259 182 260 181 101 20 102 19 103 18 104 17 105 16 106 15 107 200 294 389 293 390 292 391 291 392 494 597 701 596 490 383 275 166 56 167 55 168 54 169 53 170 52 171 51 172 50 173 49 174 48 175 47 176 46 177 45 178 312 447 311 448 310 449 309 450 308 451 307 452 306 453 305 156 6 157 5

So far the indication is that you get increasing top with increasing L, and of course much worse computation time. But there's no indication that you can't extend it indefinitely.

(L is a program parameter not defined exactly here)



 rhhardin at mindspring.com
rhhardin at att.net (either)