|
%I #23 Feb 28 2023 06:31:42
%S 0,1,0,0,1,0,0,1,0,0,1,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,1,0,
%T 0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,
%U 0,1,0,0,1,0,0,1,0,0,1,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0
%N Indicator function of A140101.
%C a(n) = 1 iff n is in A140101.
%C This sequence is "Tribonacci-automatic"; there is a 14-state automaton that takes the Tribonacci representation of n as input and accepts if and only if a(n) = 1. - _Jeffrey Shallit_, Oct 05 2022
%C This sequence is given by deleting the 2s in the Tribonacci word A080843 - _Daniel Rust_, Feb 28 2023
%H Michael De Vlieger, <a href="/A305386/b305386.txt">Table of n, a(n) for n = 1..10000</a>
%H Robbert Fokkink and Dan Rust, <a href="https://doi.org/10.1007/s00182-022-00824-1">Queen reflections: a modification of Wythoff Nim</a>, Int'l J. Game Theory (2022).
%H Jeffrey Shallit, <a href="https://arxiv.org/abs/2210.03996">Some Tribonacci conjectures</a>, arXiv:2210.03996 [math.CO], 2022.
%F A305385(n)+a(n) = A305387(n)+A305388(n) = 1 for all n.
%Y The indicator functions for A140100, A140101, A140102, A140103 are given in A305385, A305386, A305387, A305388.
%K nonn
%O 1
%A _N. J. A. Sloane_, Jun 21 2018
|
