This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A277142 Lexicographically least sequence of nonnegative integers that avoids 4/3-powers. 2
 0, 0, 0, 1, 1, 1, 0, 2, 0, 2, 0, 1, 1, 1, 0, 0, 0, 2, 1, 2, 0, 2, 1, 1, 0, 0, 0, 1, 1, 2, 0, 2, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 2, 1, 1, 1, 0, 0, 0, 1, 2, 1, 2, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 2, 0, 2, 1, 1, 0, 0, 0, 1, 1, 2, 0, 2, 1, 1, 0, 0, 0, 1, 1, 2, 0, 2, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 2, 1, 1, 1, 0, 0, 0, 1, 2, 1, 2, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,8 COMMENTS This sequence is 56-regular. LINKS Eric Rowland, Table of n, a(n) for n = 0..20000 Lara Pudwell and Eric Rowland, Avoiding fractional powers over the natural numbers, arXiv:1510.02807 [math.CO] (2015). FORMULA a(56 n + 73) = 1 if a(n) = 0. a(56 n + 73) = a(n) + 2 if a(n) != 0. MATHEMATICA (* This gives the first 4162 terms. *) With[{u = {1, 2, 0, 2, 1, 1, 0, 0, 0, 1, 1, 2, 0, 2, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 2, 1, 1, 1, 0, 0, 0, 1, 2, 1, 2, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 2, 0, 2, 1, 1, 0, 0, 0}, v = {zero, 0, 0, 1, 1, 1, 0, 2, 0, 2, 0, 1, 1, 1, 0, 0, 0, 2}}, Replace[SubstitutionSystem[{zero -> Join[v, Append[u, 1]], 0 -> Append[u, 1], n_Integer :> Append[u, n + 2]}, {zero}, {{2}}], zero -> 0, {1}]] CROSSREFS Cf. A277141 (the lexicographically least sequence that avoids a/b-powers for all a/b >= 4/3). Sequence in context: A320313 A319227 A219490 * A240592 A001877 A112712 Adjacent sequences:  A277139 A277140 A277141 * A277143 A277144 A277145 KEYWORD nonn AUTHOR Eric Rowland, Oct 01 2016 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 September 21 13:37 EDT 2019. Contains 327253 sequences. (Running on oeis4.)