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 A285402 #16 Feb 10 2021 08:13:12
%S A285402 3,6,9,12,13,14,15,16,19,22,25,28,31,32,33,34,35,38,41,44,47,50,51,52,
%T A285402 53,54,57,60,63,66,69,70,71,72,73,76,77,78,79,80,83,84,85,86,87,90,91,
%U A285402 92,93,94,97,98,99,100,101,104,107,110,113,116,117,118,119
%N A285402 Positions of 1 in A285177; complement of A285401.
%C A285402 Conjecture: a(n)/n -> (82 + sqrt(3))/47 = 1.781...
%C A285402 This conjecture is false. In fact, a(n)/n --> (5+sqrt(17))/(1+sqrt(17)) = 1.7807764... = A188485. See A285401. It follows in the same way as there, that a(n)/n --> 1/f1, where f1 is the frequency of 1's in A285177, and f1 can be computed using the Perron Frobenius theorem. - _Michel Dekking_, Feb 10 2021
%H A285402 Clark Kimberling, <a href="/A285402/b285402.txt">Table of n, a(n) for n = 1..10000</a>
%e A285402 As a word, A285177 = 001001..., in which 0 is in positions 3,6,9,12,13,...
%t A285402 s = Nest[Flatten[# /. {0 -> {1, 1}, 1 -> {0, 0, 1}}] &, {0}, 10] (* A285177 *)
%t A285402 Flatten[Position[s, 0]] (* A285401 *)
%t A285402 Flatten[Position[s, 1]] (* A285402 *)
%Y A285402 Cf. A188485, A285177, A285401, A285403.
%K A285402 nonn,easy
%O A285402 1,1
%A A285402 _Clark Kimberling_, Apr 26 2017