login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A047560
Numbers that are congruent to {0, 2, 3, 6, 7} mod 8.
1
0, 2, 3, 6, 7, 8, 10, 11, 14, 15, 16, 18, 19, 22, 23, 24, 26, 27, 30, 31, 32, 34, 35, 38, 39, 40, 42, 43, 46, 47, 48, 50, 51, 54, 55, 56, 58, 59, 62, 63, 64, 66, 67, 70, 71, 72, 74, 75, 78, 79, 80, 82, 83, 86, 87, 88
OFFSET
1,2
FORMULA
From Chai Wah Wu, May 29 2016: (Start)
a(n) = a(n-1) + a(n-5) - a(n-6) for n>6.
G.f.: x^2*(x^4 + x^3 + 3*x^2 + x + 2)/(x^6 - x^5 - x + 1). (End)
MATHEMATICA
Select[Range[0, 90], MemberQ[{0, 2, 3, 6, 7}, Mod[#, 8]]&] (* Harvey P. Dale, Nov 17 2011 *)
LinearRecurrence[{1, 0, 0, 0, 1, -1}, {0, 2, 3, 6, 7, 8}, 50] (* G. C. Greubel, May 29 2016 *)
PROG
(Magma) [n : n in [0..150] | n mod 8 in [0, 2, 3, 6, 7]]; // Wesley Ivan Hurt, May 29 2016
CROSSREFS
Sequence in context: A028757 A184798 A332021 * A032899 A375497 A193528
KEYWORD
nonn,easy
STATUS
approved