This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A284941 #8 Apr 27 2017 12:25:11
%S A284941 2,3,4,6,7,8,10,11,12,14,16,17,18,20,21,22,24,25,26,28,30,31,32,34,35,
%T A284941 36,38,39,40,42,44,45,46,48,50,51,52,54,55,56,58,59,60,62,64,65,66,68,
%U A284941 69,70,72,73,74,76,78,79,80,82,83,84,86,87,88,90,92,93
%N A284941 Positions of 1 in A284939; complement of A080580.
%C A284941 Conjecture: -1 < n*sqrt(2) - a(n) < 2 for n >= 1.
%H A284941 Clark Kimberling, <a href="/A284941/b284941.txt">Table of n, a(n) for n = 1..10000</a>
%e A284941 As a word, A284939 = 0111011101..., in which 1 is in positions 2,3,4,6,7,8,...
%t A284941 s = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {1, 1, 0, 1}}] &, {0}, 6] (* A284939 *)
%t A284941 Flatten[Position[s, 0]] (* A080580 *)
%t A284941 Flatten[Position[s, 1]] (* A284941 *)
%Y A284941 Cf. A284939, A080580.
%K A284941 nonn,easy
%O A284941 1,1
%A A284941 _Clark Kimberling_, Apr 18 2017