This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A277150 Lexicographically least sequence of nonnegative integers that avoids 7/6-powers. 1
 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 Sequence in context: A300548 A293898 A243822 * A156596 A282570 A026613 Adjacent sequences:  A277147 A277148 A277149 * A277151 A277152 A277153 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 January 15 20:47 EST 2019. Contains 319184 sequences. (Running on oeis4.)