[seqfan] Digit chaos in a window
Eric Angelini
Eric.Angelini at kntv.be
Wed Aug 18 19:50:00 CEST 2010
Hello SeqFans,
a(n) is the size of the largest possible window which includes a(n) itself and
a(n) non-repeated digits (the "window" is under the stroke "|"):
S = 1 2 3 4 5 6 7 8 9 10 6 5 7 4 8 3 9 6 5 7 4 3 2 8 6 5 7 4 3 2 6 5 4 3 2 1 7 8 9 6 ...
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
1 1 1 1 1 1 1 1 1 2 7 9 8 6 9 4 1 7 8 4 6 7 3 9 7 3 4 6 7 3 5 4 2 5 3 1 6 6 6 2
2 2 2 2 2 2 2 2 3 8 1 9 5 1 8 0 4 3 8 5 4 2 6 4 2 3 5 4 2 7 3 6 4 2 5 5 5 1
3 3 3 3 3 3 3 4 9 0 1 7 0 3 6 8 9 3 7 3 5 3 8 2 7 3 4 2 5 3 4 4 4 7
4 4 4 4 4 4 5 1 6 0 4 6 5 3 6 9 4 7 2 6 8 4 3 6 4 3 3 3 8
5 5 5 5 5 6 0 5 6 5 7 9 5 6 4 8 5 6 2 5 2 2 2 9
6 6 6 6 7 6 5 7 4 6 5 3 6 5 6 1 1 1 6
7 7 7 8 7 4 8 7 2 7 7 7 7
8 8 9 8 3 8 8 8
9 1 9 9
0
Unless I've made errors in computing this, I don't see any pattern yet: when will it
arise?!
Best,
É.
More information about the SeqFan
mailing list