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!)
A047485 Numbers that are congruent to {0, 3, 5, 7} mod 8. 1

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

%S 0,3,5,7,8,11,13,15,16,19,21,23,24,27,29,31,32,35,37,39,40,43,45,47,

%T 48,51,53,55,56,59,61,63,64,67,69,71,72,75,77,79,80,83,85,87,88,91,93,

%U 95,96,99,101,103,104,107,109,111,112,115,117,119,120,123,125

%N Numbers that are congruent to {0, 3, 5, 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 _Colin Barker_, May 14 2012: (Start)

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

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

%F From _Wesley Ivan Hurt_, Jun 04 2016: (Start)

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

%F a(2k) = A004767(k-1) for n>0, a(2k-1) = A047615(k). (End)

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

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

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

%t Select[Range[0,120], MemberQ[{0,3,5,7}, Mod[#,8]]&] (* _Harvey P. Dale_, May 20 2011 *)

%o (Magma) [n : n in [0..150] | n mod 8 in [0, 3, 5, 7]]; // _Wesley Ivan Hurt_, Jun 04 2016

%Y Cf. A004767, A047615.

%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 16:12 EDT 2024. Contains 371254 sequences. (Running on oeis4.)