



0, 1, 0, 1, 1, 2, 1, 2, 3, 2, 3, 3, 4, 3, 4, 3, 4, 4, 5, 4, 5, 6, 5, 6, 6, 7, 6, 7, 7, 8, 7, 8, 9, 8, 9, 9, 10, 9, 10, 9, 10, 10, 11, 10, 11, 12, 11, 12, 12, 13, 12, 13, 14, 13, 14, 14, 15, 14, 15, 14, 15, 15, 16, 15, 16, 17, 16, 17, 17
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,6


COMMENTS

It follows from known properties of A140100 and A140102 that the first differences of this sequence (see A317193) belong to {1, 0, 1}.
Conjecture 1: a(n) = A276796(n)  A276797(n).
Conjecture 2: The firstdifference sequence A317193 is an encoded form of the ternary tribonacci word A080843.
All these conjectures are now theorems  see the Dekking et al. paper.  N. J. A. Sloane, Jul 22 2019


LINKS

N. J. A. Sloane, Table of n, a(n) for n = 1..50000
F. Michel Dekking, Jeffrey Shallit, and N. J. A. Sloane, Queens in exile: nonattacking queens on infinite chess boards, Electronic J. Combin., 27:1 (2020), #P1.52.


CROSSREFS

Cf. A140100, A140101, A140102, A140103, A317193, A080843, A276796, A276797.
Sequence in context: A067731 A147844 A291985 * A053735 A033667 A033923
Adjacent sequences: A317189 A317190 A317191 * A317193 A317194 A317195


KEYWORD

nonn


AUTHOR

N. J. A. Sloane, Jul 31 2018


STATUS

approved



