%I #16 Mar 07 2020 06:50:25
%S 1,2,5,6,7,9,10,13,14,15,17,18,21,22,23,25,26,29,30,31,33,34,37,38,39,
%T 41,42,45,46,47,49,50,53,54,55,57,58,61,62,63,65,66,69,70,71,73,74,77,
%U 78,79,81,82,85,86,87,89
%N Numbers that are congruent to {1, 2, 5, 6, 7} mod 8.
%H G. C. Greubel, <a href="/A047580/b047580.txt">Table of n, a(n) for n = 1..1000</a>
%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,1,-1).
%F From _Chai Wah Wu_, May 30 2016: (Start)
%F a(n) = a(n-1) + a(n-5) - a(n-6), for n > 6.
%F G.f.: x*(x^5 + x^4 + x^3 + 3*x^2 + x + 1)/(x^6 - x^5 - x + 1). (End)
%t Select[Range[100],MemberQ[{1,2,5,6,7},Mod[#,8]]&] (* _Harvey P. Dale_, Jan 16 2013 *)
%t LinearRecurrence[{1, 0, 0, 0, 1, -1}, {1, 2, 5, 6, 7, 9}, 50] (* _G. C. Greubel_, May 30 2016 *)
%K nonn,easy
%O 1,2
%A _N. J. A. Sloane_
|