|
|
A102167
|
|
Lightest finite strictly increasing sequence of integers showing once and only once every pair of digits from [00] to [99]. The "weight" of such a sequence is the sum of all its a(n). Weight of this sequence is 2995.
|
|
1
|
|
|
7, 19, 20, 23, 24, 25, 26, 27, 28, 29, 30, 34, 35, 36, 37, 38, 39, 40, 45, 46, 47, 48, 49, 50, 56, 57, 58, 59, 60, 67, 68, 69, 70, 78, 79, 80, 88, 90, 99, 100, 118, 122, 133, 144, 155, 166, 177
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
It seems that it is only a conjecture that this sequence is really the lightest! - N. J. A. Sloane, Mar 15 2005
|
|
LINKS
|
|
|
EXAMPLE
|
Sequence starts with 7 19 20 23... showing pairs [71], [19], [92], [20], [02], [23]...
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,easy,nonn,fini,full
|
|
AUTHOR
|
Geoff Bailey, Richard Tucker, "Alex" and Eric Angelini, Feb 16 2005; revised Mar 15 2005
|
|
STATUS
|
approved
|
|
|
|