A277153 - 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

A277153

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

0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0

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

OFFSET

COMMENTS

This sequence is conjecturally 44-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

Conjecture: a(44 n + 2701) = a(n) + 2.

CROSSREFS

Sequence in context: A011722 A373266 A276404 * A323162 A185017 A359472

Adjacent sequences: A277150 A277151 A277152 * A277154 A277155 A277156

KEYWORD

nonn

AUTHOR

Eric Rowland, Oct 01 2016

STATUS

approved