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 A095130 #42 Dec 14 2023 05:19:32 %S A095130 0,1,1,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,1,1,0, %T A095130 0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,1, %U A095130 1,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,1,1 %N A095130 Expansion of (x+x^2)/(1-x^6); period 6: repeat [0, 1, 1, 0, 0, 0]. %C A095130 Sequences of period k composed of (k-p) zeros followed by p ones have a closed formula of floor((n mod k)/(k-p)), for p>=floor(n/2). [_Gary Detlefs_, May 18 2011] %H A095130 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,-1,1,-1,1). %F A095130 G.f.: x/(1-x+x^2-x^3+x^4-x^5); %F A095130 a(n) = 1/3-cos(2*Pi*n/3)/3+sin(Pi*n/3)/sqrt(3). %F A095130 a(n) = mod(A095129(n),3). %F A095130 a(n) = floor(((n+3) mod 6)/4). [_Gary Detlefs_, May 18 2011] %F A095130 a(0)=0, a(1)=1, a(2)=1, a(3)=0, a(4)=0, a(n) = a(n-1)-a(n-2)+a(n-3)-a(n-4)+ a(n-5). - _Harvey P. Dale_, Nov 18 2013 %F A095130 a(n) = floor((n-1)/6) - floor((n-3)/6). - _Wesley Ivan Hurt_, Sep 08 2015 %p A095130 A095130:=n->floor(((n+3) mod 6)/4); seq(A095130(n), n=0..100); # _Wesley Ivan Hurt_, Feb 24 2014 %t A095130 PadRight[{},120,{0,1,1,0,0,0}] (* or *) LinearRecurrence[{1,-1,1,-1,1},{0,1,1,0,0},120] (* _Harvey P. Dale_, Nov 18 2013 *) %o A095130 (Magma) [Floor(((n+3) mod 6)/4) : n in [0..100]]; // _Wesley Ivan Hurt_, Sep 08 2015 %o A095130 (Magma) &cat[[0,1,1,0,0,0]: n in [0..15]]; // _Vincenzo Librandi_, Sep 09 2015 %Y A095130 Cf. A011658, A095129. %K A095130 easy,nonn %O A095130 0,1 %A A095130 _Paul Barry_, May 29 2004 %E A095130 Corrected by _T. D. Noe_, Nov 08 2006