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 A047524 #43 Mar 30 2024 11:38:51
%S A047524 2,7,10,15,18,23,26,31,34,39,42,47,50,55,58,63,66,71,74,79,82,87,90,
%T A047524 95,98,103,106,111,114,119,122,127,130,135,138,143,146,151,154,159,
%U A047524 162,167,170,175,178,183,186,191,194,199,202,207,210,215,218,223,226,231,234
%N A047524 Numbers that are congruent to {2, 7} mod 8.
%C A047524 A195605 is a subsequence. - _Bruno Berselli_, Sep 21 2011
%H A047524 Muniru A Asiru, <a href="/A047524/b047524.txt">Table of n, a(n) for n = 1..5000</a>
%H A047524 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1).
%F A047524 a(n) = 8*n - a(n-1) - 7, n > 1. - _Vincenzo Librandi_, Aug 06 2010
%F A047524 From _R. J. Mathar_, Mar 22 2011: (Start)
%F A047524 a(n) = 4*n - 3/2 + (-1)^n/2.
%F A047524 G.f.: x*(2+5*x+x^2) / ( (1+x)*(x-1)^2 ). (End)
%F A047524 From _Franck Maminirina Ramaharo_, Aug 06 2018: (Start)
%F A047524 a(n) = 4*n - (n mod 2) - 1.
%F A047524 a(n) = A047615(n) + 2.
%F A047524 a(2*n) = A004771(n-1).
%F A047524 a(2*n-1) = A017089(n-1).
%F A047524 E.g.f.: ((8*x - 3)*exp(x) + exp(-x) + 2)/2. (End)
%F A047524 a(n) = a(n-1) + a(n-2) - a(n-3). - _Muniru A Asiru_, Aug 06 2018
%F A047524 Sum_{n>=1} (-1)^(n+1)/a(n) = (sqrt(2)+2)*Pi/16 - log(2)/8 - sqrt(2)*log(sqrt(2)+1)/8. - _Amiram Eldar_, Dec 11 2021
%p A047524 seq(coeff(series(x*(2+5*x+x^2)/((1+x)*(1-x)^2), x,n+1),x,n),n=1..60); # _Muniru A Asiru_, Aug 06 2018
%t A047524 Select[Range[300],MemberQ[{2,7},Mod[#,8]]&] (* or *)
%t A047524 LinearRecurrence[ {1,1,-1},{2,7,10},60] (* _Harvey P. Dale_, Nov 05 2017 *)
%t A047524 CoefficientList[ Series[(x^2 + 5x + 2)/((x - 1)^2 (x + 1)), {x, 0, 60}], x] (* _Robert G. Wilson v_, Aug 07 2018 *)
%o A047524 (Maxima) makelist(4*n - mod(n,2) - 1, n, 1, 100); /* _Franck Maminirina Ramaharo_, Aug 06 2018 */
%o A047524 (PARI) is(n) = #setintersect([n%8], [2, 7]) > 0 \\ _Felix Fröhlich_, Aug 06 2018
%o A047524 (GAP) Filtered([0..250],n->n mod 8=2 or n mod 8=7); # _Muniru A Asiru_, Aug 06 2018
%o A047524 (Python)
%o A047524 def A047524(n): return (n<<2)-1-(n&1) # _Chai Wah Wu_, Mar 30 2024
%Y A047524 Cf. A047398, A047461, A047452, A047470, A047535, A047615, A047617, A195605.
%K A047524 nonn,easy
%O A047524 1,1
%A A047524 _N. J. A. Sloane_
%E A047524 More terms from _Vincenzo Librandi_, Aug 06 2010