|
%I #28 Sep 08 2022 08:44:57
%S 0,1,2,5,7,8,9,10,13,15,16,17,18,21,23,24,25,26,29,31,32,33,34,37,39,
%T 40,41,42,45,47,48,49,50,53,55,56,57,58,61,63,64,65,66,69,71,72,73,74,
%U 77,79,80,81,82,85,87,88,89
%N Numbers that are congruent to {0, 1, 2, 5, 7} mod 8.
%H Vincenzo Librandi, <a href="/A047483/b047483.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 G.f.: x^2*(1 + x + 3*x^2 + 2*x^3 + x^4)/((1-x)^2*(1 + x + x^2 + x^3 + x^4)). - _Colin Barker_, May 14 2012
%F a(n) = a(n-1) + a(n-5) - a(n-6). - _Vincenzo Librandi_, May 17 2012
%t Select[Range[0,300],MemberQ[{0,1,2,5,7},Mod[#,8]]&] (* _Vincenzo Librandi_, May 17 2012 *)
%t LinearRecurrence[{1,0,0,0,1,-1},{0,1,2,5,7,8},80] (* _Harvey P. Dale_, Jul 04 2021 *)
%o (Magma) I:=[0, 1, 2, 5, 7, 8]; [n le 6 select I[n] else Self(n-1)+Self(n-5)-Self(n-6): n in [1..70]]; // _Vincenzo Librandi_, May 17 2012
%K nonn,easy
%O 1,3
%A _N. J. A. Sloane_
|
