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 A145011 #33 Mar 08 2024 01:12:14 %S A145011 6,4,2,4,2,4,6,2,6,4,2,4,2,4,6,2,6,4,2,4,2,4,6,2,6,4,2,4,2,4,6,2,6,4, %T A145011 2,4,2,4,6,2,6,4,2,4,2,4,6,2,6,4,2,4,2,4,6,2,6,4,2,4,2,4,6,2,6,4,2,4, %U A145011 2,4,6,2,6,4,2,4,2,4,6,2,6,4,2,4,2,4,6,2,6,4,2,4,2,4,6,2 %N A145011 First differences of A007775. %C A145011 Also the first differences of A084968 divided by 7. - _Antti Karttunen_, May 01 2015 %H A145011 Reinhard Zumkeller, <a href="/A145011/b145011.txt">Table of n, a(n) for n = 1..10000</a> %H A145011 <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 A145011 Period 8: repeat 6,4,2,4,2,4,6,2. %F A145011 a(n) = 2*((abs(abs((n mod 8) - 3) - 1) mod 3) + 1). - _Pieter Stadhouders_, Mar 09 2010 %F A145011 G.f.: x*(-2*x^7 - 6*x^6 - 4*x^5 - 2*x^4 - 4*x^3 - 2*x^2 - 4*x - 6)/(x^8 - 1). - _Chai Wah Wu_, Feb 16 2021 %t A145011 Differences[Select[Range[400],GCD[#,30]==1&]] (* _Harvey P. Dale_, Dec 07 2011 *) %o A145011 (Haskell) %o A145011 a145011 n = a145011_list !! (n-1) %o A145011 a145011_list = zipWith (-) (tail a007775_list) a007775_list %o A145011 -- _Reinhard Zumkeller_, Jan 06 2013 %o A145011 (PARI) a(n)=[4,6,4,2,4,2][n%8+1] \\ _Charles R Greathouse IV_, Oct 20 2013 %Y A145011 Cf. A007775, A084968. %Y A145011 Multiplied by 7: row 4 of A257251. %K A145011 nonn,easy %O A145011 1,1 %A A145011 _Ki Punches_, Feb 25 2009 %E A145011 Edited by _Omar E. Pol_, Mar 02 2009 %E A145011 Offset corrected by _Reinhard Zumkeller_, Jan 06 2013