cp's OEIS Frontend

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.

A047615 Numbers that are congruent to {0, 5} mod 8.

This page as a plain text file.
%I A047615 #66 Mar 30 2024 11:38:43
%S A047615 0,5,8,13,16,21,24,29,32,37,40,45,48,53,56,61,64,69,72,77,80,85,88,93,
%T A047615 96,101,104,109,112,117,120,125,128,133,136,141,144,149,152,157,160,
%U A047615 165,168,173,176,181,184,189,192,197,200,205,208,213,216,221,224,229,232
%N A047615 Numbers that are congruent to {0, 5} mod 8.
%H A047615 Colin Barker, <a href="/A047615/b047615.txt">Table of n, a(n) for n = 1..1000</a>
%H A047615 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1).
%F A047615 a(n) = 8*n-a(n-1)-11 (with a(1)=0). - _Vincenzo Librandi_, Aug 06 2010
%F A047615 a(n+1) = Sum_{k>=0} A030308(n,k)*b(k) with b(0)=5 and b(k)=2^(k+2) for k>0. - _Philippe Deléham_, Oct 17 2011
%F A047615 From _Wesley Ivan Hurt_, Mar 26 2015: (Start)
%F A047615 a(n) = a(n-1)+a(n-2)-a(n-3).
%F A047615 a(n) = (8n - 7 + (-1)^n)/2. (End)
%F A047615 G.f.: x^2*(5+3*x) / ((1-x)^2*(1+x)). - _Colin Barker_, Aug 25 2016
%F A047615 From _Franck Maminirina Ramaharo_, Jul 23 2018: (Start)
%F A047615 a(n) = A047470(n) - (-1)^(n - 1) + 1.
%F A047615 E.g.f.: (6 + exp(-x) + (8*x - 7)*exp(x))/2. (End)
%F A047615 Sum_{n>=2} (-1)^n/a(n) = log(2)/2 - (sqrt(2)-1)*Pi/16 - sqrt(2)*log(sqrt(2)+1)/8. - _Amiram Eldar_, Dec 18 2021
%p A047615 a:=n->add(4-(-1)^j, j=1..n): seq(a(n), n=0..59); # _Zerinvary Lajos_, Dec 13 2008
%t A047615 Table[(8 n - 7 + (-1)^n)/2, {n, 1, 40}] (* _Wesley Ivan Hurt_, Mar 26 2015 *)
%t A047615 Rest@ CoefficientList[Series[x^2*(5 + 3 x)/((1 - x)^2*(1 + x)), {x, 0, 59}], x] (* _Michael De Vlieger_, Aug 25 2016 *)
%t A047615 Rest@(Range[0, 60]! CoefficientList[ Series[(6 + Exp[-x] + (8 x - 7)*Exp[x])/2, {x, 0, 60}], x]) (* or *)
%t A047615 LinearRecurrence[{1, 1, -1}, {0, 5, 8}, 60] (* _Robert G. Wilson v_, Jul 23 2018 *)
%o A047615 (PARI) forstep(n=0,200,[5,3],print1(n", ")) \\ _Charles R Greathouse IV_, Oct 17 2011
%o A047615 (PARI) concat(0, Vec(x^2*(5+3*x)/((1-x)^2*(1+x)) + O(x^100))) \\ _Colin Barker_, Aug 25 2016
%o A047615 (Magma) [(8*n - 7 + (-1)^n)/2 : n in [1..50]]; // _Wesley Ivan Hurt_, Mar 26 2015
%o A047615 (GAP) Filtered([0..250], n->n mod 8=0 or n mod 8=5); # _Muniru A Asiru_, Jul 23 2018
%o A047615 (Python)
%o A047615 def A047615(n): return (n<<2)-3-(n&1) # _Chai Wah Wu_, Mar 30 2024
%Y A047615 Union of A008590 and A004770.
%Y A047615 Cf. A047398, A047452, A047461, A047470, A047524, A047535, A047617.
%K A047615 nonn,easy
%O A047615 1,2
%A A047615 _N. J. A. Sloane_
%E A047615 More terms from _Vincenzo Librandi_, Aug 06 2010