A277150 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A277150

Lexicographically least sequence of nonnegative integers that avoids 7/6-powers.

0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 2, 0, 2, 0, 2, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 2, 1, 2, 1, 2, 0, 0, 0, 0, 0, 3, 1, 1, 1, 1, 1, 0, 0, 2, 0, 2, 0, 1, 1, 0, 1, 0, 1, 2, 0, 1, 0, 1, 0, 0, 1, 2, 1, 2, 1, 1, 0, 0, 0, 0, 0, 2, 1, 1, 1, 1, 1, 3, 0, 2, 0, 2, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 2, 1, 2, 1, 2, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,14

COMMENTS

This sequence is conjecturally 41190-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).

Eric Rowland, List of first 400000 terms

FORMULA

Conjecture: a(41190 n + 41201) = a(n) + 3.

CROSSREFS