cp's OEIS Frontend

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

%I A047349 #20 Sep 08 2022 08:44:57
%S A047349 0,2,4,7,9,11,14,16,18,21,23,25,28,30,32,35,37,39,42,44,46,49,51,53,
%T A047349 56,58,60,63,65,67,70,72,74,77,79,81,84,86,88,91,93,95,98,100,102,105,
%U A047349 107,109,112,114,116,119,121,123,126,128,130,133,135,137,140,142
%N A047349 Numbers that are congruent to {0, 2, 4} mod 7.
%H A047349 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,1,-1).
%F A047349 a(n+1) = floor(n/3)+2*n. - _Gary Detlefs_, Mar 27 2010
%F A047349 G.f.: x^2*(2+2*x+3*x^2)/((1+x+x^2)*(x-1)^2). - _R. J. Mathar_, Oct 08 2011
%F A047349 a(n) = n + floor(4*(n-1)/3) - 1. - _Arkadiusz Wesolowski_, Sep 18 2012
%F A047349 From _Wesley Ivan Hurt_, Jun 10 2016: (Start)
%F A047349 a(n) = a(n-1) + a(n-3) - a(n-4) for n>4.
%F A047349 a(n) = (21*n-24-3*cos(2*n*Pi/3)+sqrt(3)*sin(2*n*Pi/3))/9.
%F A047349 a(3k) = 7k-3, a(3k-1) = 7k-5, a(3k-2) = 7k-7. (End)
%p A047349 seq(floor(n/3)+2*n, n=0..52); # _Gary Detlefs_, Mar 27 2010
%t A047349 Select[Range[0, 150], MemberQ[{0, 2, 4}, Mod[#, 7]] &] (* _Wesley Ivan Hurt_, Jun 10 2016 *)
%o A047349 (Magma) [n : n in [0..150] | n mod 7 in [0, 2, 4]]; // _Wesley Ivan Hurt_, Jun 10 2016
%K A047349 nonn,easy
%O A047349 1,2
%A A047349 _N. J. A. Sloane_