This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A308831 Start with generation 0, which is 0,1,2. For generation N>=1, extend the existing sequence into a non-cyclic ternary de Bruijn sequence of order N. If more than one extension is possible, choose the lexicographically earliest. 1
 0, 1, 2, 0, 0, 2, 2, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 2, 1, 0, 2, 0, 2, 1, 2, 2, 2, 0, 1, 0, 0, 1, 1, 0, 1, 0, 2, 1, 0, 0, 2, 0, 0, 0, 0, 2, 1, 1, 1, 1, 0, 2, 2, 0, 0, 1, 2, 1, 1, 2, 0, 1, 1, 2, 2, 0, 2, 0, 1, 2, 2, 1, 2, 1, 2, 0, 2, 2, 2, 2, 1, 0, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS A. D. Skovgaard, Python program to generate the sequence, with explanatory comments EXAMPLE Generation 1: [012] (All ternary sequences of length 1 now appear. With 3! = 6 solutions, the lexicographically smallest is chosen.) Generation 2: [0120022110] (The sequence is extended from the previous generation, now including all ternary sequences of length 2.) The process continues. CROSSREFS Sequence in context: A107502 A230419 A146165 * A277327 A277328 A318178 Adjacent sequences:  A308828 A308829 A308830 * A308832 A308833 A308834 KEYWORD nonn AUTHOR A. D. Skovgaard, Jun 27 2019 STATUS approved

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

Last modified December 13 22:55 EST 2019. Contains 329974 sequences. (Running on oeis4.)