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 A089013 #20 Aug 03 2020 02:03:54 %S A089013 1,0,0,1,0,0,1,1,0,0,0,1,1,0,1,1,0,0,0,1,0,0,1,1,1,0,0,1,1,0,1,1,0,0, %T A089013 0,1,0,0,1,1,0,0,0,1,1,0,1,1,1,0,0,1,0,0,1,1,1,0,0,1,1,0,1,1,0,0,0,1, %U A089013 0,0,1,1,0,0,0,1,1,0,1,1,0,0,0,1,0,0,1,1,1,0,0,1,1,0,1,1,1,0,0,1,0,0,1,1,0,0,0,1 %N A089013 a(n) = (A088567(8n) mod 2). %C A089013 This is just to give a pointer to A088567, A089013 and A014707. %H A089013 N. J. A. Sloane and J. A. Sellers, <a href="https://arxiv.org/abs/math/0312418">On non-squashing partitions</a>, arXiv:math/0312418 [math.CO], 2003. %H A089013 N. J. A. Sloane and J. A. Sellers, <a href="https://doi.org/10.1016/j.disc.2004.11.014">On non-squashing partitions</a>, Discrete Math., 294 (2005), 259-274. %H A089013 <a href="/index/Fo#fold">Index entries for sequences obtained by enumerating foldings</a> %F A089013 a(0) = 1, a(2*n) = a(n) for n > 0 and a(2*n+1) = (n mod 2) for n >= 0. - _A.H.M. Smeets_, Aug 02 2018 %Y A089013 A038189(n)=a(n) if n>0. %K A089013 nonn,easy %O A089013 0,1 %A A089013 _N. J. A. Sloane_, Dec 20 2003