Hello math-fun and seqfan;
I'm trying to find a finite sequence like this one :
1 8 9 10 11 20 21 30 31 40 41 50 51 60 61 70 71 90 92
93 94 95 96 97 98 223 242 526 533 543 627 634 644 728
737 745 755 800 838 848 5667 8681
... where one can read once and only once all the "di-
grams" formed by the digits 0 to 9 [thus the digrams
00, 01, 02, 03, 04, ... 09
10, 11, 12, 13, 14, ... 19
...
90, 91, 92, 93, 94, ... 99].
The "best" sequence would be the "lightest" one -- the
"weight" of a finite sequence being the sum of all it's
terms (the example here has a "weight" of 25111).
The above sequence shows almost all the digrams -- only
[99] is missing...
Best,
Éric Angelini -- Brussels, Belgium.
