cp's OEIS Frontend

A047293 Numbers that are congruent to {0, 2, 4, 6} mod 7.

%I A047293 #27 Sep 08 2022 08:44:56
%S A047293 0,2,4,6,7,9,11,13,14,16,18,20,21,23,25,27,28,30,32,34,35,37,39,41,42,
%T A047293 44,46,48,49,51,53,55,56,58,60,62,63,65,67,69,70,72,74,76,77,79,81,83,
%U A047293 84,86,88,90,91,93,95,97,98,100,102,104,105,107,109,111
%N A047293 Numbers that are congruent to {0, 2, 4, 6} mod 7.
%H A047293 Vincenzo Librandi, <a href="/A047293/b047293.txt">Table of n, a(n) for n = 1..5000</a>
%H A047293 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,1,-1).
%F A047293 a(n) = floor(ceiling((7n + 2)/2)/2).
%F A047293 a(n) = 2n-2-floor((n-1)/4). - _Gary Detlefs_, Mar 27 2010
%F A047293 From _Colin Barker_, Mar 13 2012: (Start)
%F A047293 a(n) = a(n-1)+a(n-4)-a(n-5) for n>5.
%F A047293 G.f.: x^2*(2+2*x+2*x^2+x^3)/((1-x)^2*(1+x)*(1+x^2)). (End)
%F A047293 From _Wesley Ivan Hurt_, May 21 2016: (Start)
%F A047293 a(n) = (14n-11+i^(2n)+(1-i)*i^(-n)+(1+i)*i^n)/8 where i=sqrt(-1).
%F A047293 a(2n) = A047276(n), a(2n-1) = A047345(n). (End)
%p A047293 A047293:=n->2*n-2-floor((n-1)/4): seq(A047293(n), n=1..100); # _Wesley Ivan Hurt_, May 21 2016
%t A047293 Select[Range[0,100],MemberQ[{0,2,4,6},Mod[#,7]]&] (* _Vincenzo Librandi_, Apr 26 2012 *)
%t A047293 LinearRecurrence[{1,0,0,1,-1},{0,2,4,6,7},80] (* _Harvey P. Dale_, Jun 21 2019 *)
%o A047293 (Magma) I:=[0, 2, 4, 6, 7]; [n le 5 select I[n] else Self(n-1)+Self(n-4)-Self(n-5): n in [1..70]]; // _Vincenzo Librandi_, Apr 26 2012
%o A047293 (PARI) A047293(n)=n*7\4-1  \\ _M. F. Hasler_, Apr 27 2012
%Y A047293 Cf. A047276, A047345.
%K A047293 nonn,easy
%O A047293 1,2
%A A047293 _N. J. A. Sloane_