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”).
%I #8 May 15 2019 10:26:25
%S 1,1,1,1,1,1,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,
%T 0,0,1,0,0,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,
%U 1,0,0,0,0,1,0,0,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0
%N The terms of A308007 appear to lie on two lines; set a(n) = 0 if A308007(n) is on the lower line (defined by A308009(n) <= n), a(n) = 1 if it is on the upper line (defined by a(n) >= n).
%C The first six terms of A308007 lie on both lines, so a(n) for n <= 6 is both 0 and 1.
%C More than the usual number of terms are given in order to show the irregularities.
%C It is only a (strong) conjecture that the terms of A308007 line on two lines. Certainly this is true for the first million terms.
%H N. J. A. Sloane, <a href="/A308016/b308016.txt">Table of n, a(n) for n = 1..5000</a>
%Y Cf. A081145, A308007, A308009.
%K nonn
%O 1
%A _N. J. A. Sloane_, May 15 2019