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 A158607 #17 Aug 31 2024 18:44:22 %S A158607 9,11,13,5,7,9,11,13,5,7,9,11,13,5,7,9,11,13,5,7,9,11,13,5,7,9,11,13, %T A158607 5,7,9,11,13,5,7,9,11,13,5,7,9,11,13,5,7,9,11,13,5,7,9,11,13,5,7,9,11, %U A158607 13,5,7,9,11,13,5,7,9,11,13,5,7,9,11,13,5,7,9,11,13,5,7 %N A158607 Period 5: repeat 9,11,13,5,7. %H A158607 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,1). %F A158607 a(n) = A158606(2n-1) + A158606(2n). %F A158607 G.f.: -x*(9+11*x+13*x^2+5*x^3+7*x^4)/((x-1)*(1+x+x^2+x^3+x^4)). - _R. J. Mathar_, Apr 08 2009 %F A158607 a(n) = 2*n+7-10*floor((n+1)/5). - _Aaron J Grech_, Aug 30 2024 %Y A158607 Cf. A158606. %K A158607 nonn,easy %O A158607 1,1 %A A158607 _Paul Curtz_, Mar 22 2009 %E A158607 Edited by _R. J. Mathar_, Apr 08 2009