login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047553 Numbers that are congruent to {0, 2, 6, 7} mod 8. 1

%I #18 Sep 08 2022 08:44:57

%S 0,2,6,7,8,10,14,15,16,18,22,23,24,26,30,31,32,34,38,39,40,42,46,47,

%T 48,50,54,55,56,58,62,63,64,66,70,71,72,74,78,79,80,82,86,87,88,90,94,

%U 95,96,98,102,103,104,106,110,111,112,114,118,119,120,122,126

%N Numbers that are congruent to {0, 2, 6, 7} mod 8.

%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,1,-1).

%F From _Wesley Ivan Hurt_, May 29 2016: (Start)

%F G.f.: x^2*(2+4*x+x^2+x^3) / ((x-1)^2*(1+x+x^2+x^3)).

%F a(n) = a(n-1) + a(n-4) - a(n-5) for n>5.

%F a(n) = (8*n-5-i^(2*n)+(1-2*i)*i^(-n)+(1+2*i)*i^n)/4 where i=sqrt(-1).

%F a(2k) = A047524(k), a(2k-1) = A047451(k). (End)

%F E.g.f.: (2 - 2*sin(x) + cos(x) + (4*x - 2)*sinh(x) + (4*x - 3)*cosh(x))/2. - _Ilya Gutkovskiy_, May 29 2016

%F Sum_{n>=2} (-1)^n/a(n) = (8-sqrt(2))*log(2)/16 + sqrt(2)*log(2+sqrt(2))/8 - (sqrt(2)-1)*Pi/16. - _Amiram Eldar_, Dec 21 2021

%p A047553:=n->(8*n-5-I^(2*n)+(1-2*I)*I^(-n)+(1+2*I)*I^n)/4: seq(A047553(n), n=1..100); # _Wesley Ivan Hurt_, May 29 2016

%t Select[Range[0,200], MemberQ[{0,2,6,7}, Mod[#,8]]&] (* _Harvey P. Dale_, Aug 09 2013 *)

%o (Magma) [n : n in [0..150] | n mod 8 in [0, 2, 6, 7]]; // _Wesley Ivan Hurt_, May 29 2016

%Y Cf. A047451, A047524.

%K nonn,easy

%O 1,2

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)