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 A133894 #24 Mar 19 2024 08:31:15
%S A133894 12,13,14,15,28,29,30,31,44,45,46,47,60,61,62,63,76,77,78,79,92,93,94,
%T A133894 95,108,109,110,111,124,125,126,127,140,141,142,143,156,157,158,159,
%U A133894 172,173,174,175,188,189,190,191,204,205,206,207,220,221,222,223,236,237
%N A133894 Numbers m such that binomial(m+4,m) mod 4 = 0.
%C A133894 Also numbers m such that floor(1+(m/4)) mod 4 = 0.
%C A133894 Partial sums of the sequence 12,1,1,1,13,1,1,1,13, ... which has period 4.
%C A133894 Numbers congruent to {12,13,14,15} mod 16. Numbers n such that n xor 12 = n - 12. [_Brad Clardy_, May 06 2013]
%H A133894 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,1,-1).
%F A133894 a(n) = 4*n + 12 - 3*(n mod 4).
%F A133894 G.f.: 12/(1-x)+x(1+x+x^2+13x^3)/((1-x^4)(1-x)) = (12+x+x^2+x^3+x^4)/((1-x^4)(1-x)) = (12-11x-x^5)/((1-x^4)(1-x)^2).
%F A133894 a(n) = 4*n+3*((1-i)*i^n+(1+i)*(-i)^n+(-1)^n+5)/2, where i=sqrt(-1). - _Bruno Berselli_, Apr 08 2011
%o A133894 (PARI) a(n)=(n+3)\4*16-[1,4,3,2][n%4+1] \\ _Charles R Greathouse IV_, May 06 2013
%Y A133894 Cf. A000040, A133620, A133621, A133623, A133630, A133635, A133874, A133884, A133890, A133900, A133910.
%K A133894 nonn,easy
%O A133894 1,1
%A A133894 _Hieronymus Fischer_, Oct 20 2007