|
%I #33 Dec 18 2021 04:11:17
%S 6,7,14,15,22,23,30,31,38,39,46,47,54,55,62,63,70,71,78,79,86,87,94,
%T 95,102,103,110,111,118,119,126,127,134,135,142,143,150,151,158,159,
%U 166,167,174,175,182,183,190,191,198,199,206,207,214,215,222,223,230,231
%N Numbers that are congruent to {6, 7} mod 8.
%C These are the values of n for which binomial(n,6) is odd. See Maple code. - _Gary Detlefs_, Nov 29 2011
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1).
%F a(n) = 8*n-a(n-1)-3 with n>1, a(1)=6. - _Vincenzo Librandi_, Aug 06 2010
%F a(n) = 6*floor((n-1)/2) + n + 5. - _Gary Detlefs_, Nov 29 2011
%F a(n) = a(n-1)+a(n-2)-a(n-3). G.f.: x*(6+x+x^2)/((1-x)^2*(1+x)). - _Colin Barker_, Mar 18 2012
%F a(n) = (1-3*(-1)^n+8*n)/2. - _Colin Barker_, May 14 2012
%F Sum_{n>=1} (-1)^(n+1)/a(n) = sqrt(2)*Pi/16 - log(2)/8 - sqrt(2)*log(sqrt(2)+1)/8. - _Amiram Eldar_, Dec 18 2021
%p for i from 1 to 240 do if(floor((i mod 8)/6) <>0) then print(i) fi od; # _Gary Detlefs_, Nov 30 2011
%t LinearRecurrence[{1,1,-1},{6,7,14},60] (* _Harvey P. Dale_, Sep 11 2017 *)
%Y Union of A017137 and A004771.
%Y Cf. A047451, A047521.
%K nonn,easy
%O 1,1
%A _N. J. A. Sloane_
|
