|
Search: id:A097500
|
|
|
| A097500 |
|
Write each non-multiple of 3 integer >0 on a single label. Put the labels in numerical order to form an infinite sequence L. Now consider the succession of single digits of A008585 (multiples of 3): 3,6,9,1,2,1,5,1,8,2,1,2,4,2,7,3,0,3,3,3,6,3,9,4,2,4,5,4,8,5,1,5,4,5,7,6,0... The sequence S gives a rearrangement of the labels that reproduces the same succession of digits, subject to the constraint that the smallest label must be used that does not lead to a contradiction. |
|
+0
2
|
|
| 3691, 2, 1, 5, 182, 124, 27303336394, 245, 4, 8, 515, 457, 606366697, 275, 7, 88, 184, 879093969910, 2105, 10, 811, 11, 14, 1171, 20, 1231, 26, 1291, 32, 13, 5138, 1411, 44, 1471, 50, 1531, 56, 1591, 62
(list; graph; listen)
|
|
|
OFFSET
|
3,1
|
|
|
COMMENT
|
This could be roughly rephrased like this: "Re-write in the most economical way the "multiples-of-3 pattern" using only non-multiples of 3. No two same non-multiples of 3 will be used."
|
|
EXAMPLE
|
We must begin with 3,6,9,1,2,... and we cannot represent "3" by the label "3" or "36", or "369" because they do not exist. So the next possibility is the label "3691" (first available non-multiple of 3 in L). Labels of L cannot be used more than once.
|
|
CROSSREFS
|
Sequence in context: A143930 A015294 A103608 this_sequence A061660 A035780 A108004
Adjacent sequences: A097497 A097498 A097499 this_sequence A097501 A097502 A097503
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), Sep 19 2004
|
|
|
Search completed in 0.002 seconds
|
