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!)
A047586 Numbers that are congruent to {2, 3, 5, 6, 7} mod 8. 1
2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 18, 19, 21, 22, 23, 26, 27, 29, 30, 31, 34, 35, 37, 38, 39, 42, 43, 45, 46, 47, 50, 51, 53, 54, 55, 58, 59, 61, 62, 63, 66, 67, 69, 70, 71, 74, 75, 77, 78, 79, 82, 83, 85, 86, 87, 90, 91, 93, 94, 95, 98, 99, 101, 102, 103 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
From Wesley Ivan Hurt, Jul 28 2016: (Start)
G.f.: x*(2+x+2*x^2+x^3+x^4+x^5)/((x-1)^2*(1+x+x^2+x^3+x^4)).
a(n) = a(n-1) + a(n-5) - a(n-6) for n > 6, a(n) = a(n-5) + 8 for n > 5.
a(n) = (40*n - 5 + 3*(n mod 5) + 3*((n+1) mod 5) - 2*((n+2) mod 5) + 3*((n+3) mod 5) - 7*((n+4) mod 5))/25.
a(5k) = 8k-1, a(5k-1) = 8k-2, a(5k-2) = 8k-3, a(5k-3) = 8k-5, a(5k-4) = 8k-6. (End)
MAPLE
A047586:=n->8*floor(n/5)+[(2, 3, 5, 6, 7)][(n mod 5)+1]: seq(A047586(n), n=0..100); # Wesley Ivan Hurt, Jul 28 2016
MATHEMATICA
Select[Range[0, 300], MemberQ[{2, 3, 5, 6, 7}, Mod[#, 8]] &] (* Wesley Ivan Hurt, Jul 28 2016 *)
LinearRecurrence[{1, 0, 0, 0, 1, -1}, {2, 3, 5, 6, 7, 10}, 80] (* Harvey P. Dale, Aug 10 2023 *)
PROG
(Magma) [n : n in [0..150] | n mod 8 in [2, 3, 5, 6, 7]]; // Wesley Ivan Hurt, Jul 28 2016
CROSSREFS
Sequence in context: A077337 A093501 A087007 * A103841 A003754 A293427
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 12:09 EDT 2024. Contains 371838 sequences. (Running on oeis4.)