The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 1
 4, 5, 6, 7, 8, 41, 51, 63, 72, 83, 200 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS "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. LINKS Table of n, a(n) for n=1..11. CROSSREFS Cf. A108116 and A132291 Sequence in context: A140293 A075341 A309358 * A068521 A196697 A068318 Adjacent sequences: A143786 A143787 A143788 * A143790 A143791 A143792 KEYWORD base,easy,fini,nonn AUTHOR Dan Hoey and Eric Angelini, Sep 01 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 5 09:44 EST 2024. Contains 370545 sequences. (Running on oeis4.)