|
Search: id:A143789
|
|
|
| A143789 |
|
Lightest finite monotonically increasing sequence obtained by chunking an 18-digit Skolem-Langford integer (see A108116). There are d digits between two d's in the sequence. |
|
+0
1
|
|
| 4, 5, 6, 7, 8, 41, 51, 63, 72, 83, 200
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
"Lightest" --> the weight of such a sequence is the sum of all its terms; "Finite" --> by definition all such sequences are finite; "Monotonically" --> no two adjacent terms in the sequence are the same; "Increasing" --> a(n) < a(n+1); "Chunking" --> cutting in slices. The original Skolem-Langford number is 456784151637283200 [this is a(14565) in "D. Wilson, Complete table of n, a(n) for n = 1..20120", which can be found at A108116] and this integer, properly chunked, produces the sequence]. In the sequence there is no digit between the two 0's, there is one digit between the two 1's, there are two digits between the two 2's,... there are eight digits between the two 8's. This sequence has been computed by Dan Hoey.
|
|
CROSSREFS
|
A108116 and A132291
Sequence in context: A071623 A140293 A075341 this_sequence A068521 A068318 A066485
Adjacent sequences: A143786 A143787 A143788 this_sequence A143790 A143791 A143792
|
|
KEYWORD
|
base,easy,fini,nonn
|
|
AUTHOR
|
Dan Hoey and Eric Angelini (eric.angelini(AT)skynet.be), Sep 01 2008
|
|
|
Search completed in 0.002 seconds
|
