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 A109011 #32 Feb 12 2019 04:41:09 %S A109011 8,1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,8,1, %T A109011 2,1,4,1,2,1,8,1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,8,1,2,1, %U A109011 4,1,2,1,8,1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,8,1,2,1,4 %N A109011 a(n) = gcd(n,8). %H A109011 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,1). %F A109011 a(n) = 1 + [2|n] + 2*[4|n] + 4*[8|n], where [x|y] = 1 when x divides y, 0 otherwise. %F A109011 a(n) = a(n-8). %F A109011 Multiplicative with a(p^e) = gcd(p^e, 8). - _David W. Wilson_, Jun 12 2005 %F A109011 G.f.: ( -8 - x - 2*x^2 - x^3 - 4*x^4 - x^5 - 2*x^6 - x^7 ) / ( (x-1)*(1+x)*(x^2+1)*(x^4+1) ). - _R. J. Mathar_, Apr 04 2011 %F A109011 Dirichlet g.f.: zeta(s)*(1 + 1/2^s + 2/4^s + 4/8^s). - _R. J. Mathar_, Apr 04 2011 %F A109011 a(n) = 2^(-(101*m^7 - 2464*m^6 + 23786*m^ 5 -115360*m^4 + 293909*m^3 - 371056*m^2 + 186204*m - 15120)/5040) where m = (n mod 8). - _Luce ETIENNE_, Nov 18 2018 %t A109011 a[n_]:= GCD[n,8]; Array[a, 100, 0] (* _Stefano Spezia_, Nov 19 2018 *) %o A109011 (PARI) a(n) = gcd(n, 8) \\ _David A. Corneth_, Nov 19 2018 %Y A109011 Cf. A010877, A109004. %K A109011 nonn,easy,mult %O A109011 0,1 %A A109011 _Mitch Harris_