The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A047485 Numbers that are congruent to {0, 3, 5, 7} mod 8. 1
 0, 3, 5, 7, 8, 11, 13, 15, 16, 19, 21, 23, 24, 27, 29, 31, 32, 35, 37, 39, 40, 43, 45, 47, 48, 51, 53, 55, 56, 59, 61, 63, 64, 67, 69, 71, 72, 75, 77, 79, 80, 83, 85, 87, 88, 91, 93, 95, 96, 99, 101, 103, 104, 107, 109, 111, 112, 115, 117, 119, 120, 123, 125 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Index entries for linear recurrences with constant coefficients, signature (1,0,0,1,-1). FORMULA From Colin Barker, May 14 2012: (Start) G.f.: x^2*(3+2*x+2*x^2+x^3)/((1-x)^2*(1+x)*(1+x^2)). a(n) = (-5+(-1)^n-i*(-i)^n+i*i^n+8*n)/4 where i=sqrt(-1). (End) From Wesley Ivan Hurt, Jun 04 2016: (Start) a(n) = a(n-1) + a(n-4) - a(n-5) for n>5. a(2k) = A004767(k-1) for n>0, a(2k-1) = A047615(k). (End) E.g.f.: (2 - sin(x) + (4*x - 3)*sinh(x) + (4*x - 2)*cosh(x))/2. - Ilya Gutkovskiy, Jun 04 2016 MAPLE 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 MATHEMATICA Select[Range[0, 120], MemberQ[{0, 3, 5, 7}, Mod[#, 8]]&] (* Harvey P. Dale, May 20 2011 *) PROG (MAGMA) [n : n in [0..150] | n mod 8 in [0, 3, 5, 7]]; // Wesley Ivan Hurt, Jun 04 2016 CROSSREFS Cf. A004767, A047615. Sequence in context: A190061 A288624 A168162 * A024969 A296233 A276112 Adjacent sequences:  A047482 A047483 A047484 * A047486 A047487 A047488 KEYWORD nonn,easy AUTHOR STATUS approved

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

Last modified December 3 11:54 EST 2020. Contains 338900 sequences. (Running on oeis4.)