A277142 Lexicographically least sequence of nonnegative integers that avoids 4/3-powers.

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

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: A219490 A341021 A358331 * A240592 A001877 A339896

Adjacent sequences: A277139 A277140 A277141 * A277143 A277144 A277145

Keyword

nonn

Author

Eric Rowland, Oct 01 2016

Status

approved