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 A100283 #22 Apr 01 2022 11:39:02 %S A100283 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,1,0,0,1, %T A100283 0,0,1,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,1, %U A100283 0,0,1,0,0,1,0,0,1,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 %N A100283 a(n) = floor(p*(n+1)) - floor(p*(n)) - 1 where p = Padovan plastic number = 1.324718... (cf. A060006). %C A100283 A rabbit-like sequence generated by the Padovan plastic number. %C A100283 The well-known rabbit sequence is generated by taking the difference between the nearest integer less than phi*(n+1) minus the nearest integer less than phi*(n). If this value is 2, then the n-th rabbit sequence value is one. If this value is 1, the n-th rabbit sequence is 0. The sequence given is calculated in a similar manner, but using the plastic constant = 1.324717957244... instead of phi = 1.618033... = (1+sqrt(5))/2. It is 0001 followed by 11 copies of 001 followed by 0001 followed by 12 copies of 001 followed by 11 copies of 001 followed by similar patterns of 0001 followed by n copies of 001 where n is 11 or 12. %D A100283 Midhat J. Gazale, Gnomon: From Pharaohs to Fractals, Princeton University Press, 1999 %H A100283 Ian Stewart, <a href="https://www.jstor.org/stable/24989576">Tales of a Neglected Number</a>, Mathematical Recreations, Scientific American, Vol. 274, No. 6 (1996), pp. 102-103. %o A100283 (PARI) p=(sqrt(23/108)+.5)^(1/3) + (abs( sqrt(23/108) -.5))^(1/3); for(n = 0, n = 200, r = floor(p*(n+1)) - floor(p*n) -1; print (r )) %Y A100283 Cf. A000931, A005614, A060006. %K A100283 nonn %O A100283 0,1 %A A100283 _John Lien_, Dec 28 2004 %E A100283 Partially edited by _N. J. A. Sloane_, Jun 13 2007