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

A277154

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

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

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

OFFSET

COMMENTS

This sequence is conjecturally 26-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(26 n + 428) = a(n) + 1 for all n >= 1 (but not for n = 0).

CROSSREFS

Sequence in context: A278701 A188300 A353475 * A011723 A037913 A037833

Adjacent sequences: A277151 A277152 A277153 * A277155 A277156 A277157

KEYWORD

nonn

AUTHOR

Eric Rowland, Oct 01 2016

STATUS

approved