%I #41 Sep 08 2022 08:44:33
%S 0,1,2,3,4,5,6,8,9,10,11,12,13,14,16,17,18,19,20,21,22,24,25,26,27,28,
%T 29,30,32,33,34,35,36,37,38,40,41,42,43,44,45,46,48,49,50,51,52,53,54,
%U 56,57,58,59,60,61,62,64,65,66,67,68,69,70,72,73,74,75,76,77
%N Numbers not congruent to 7 mod 8.
%C Numbers that are congruent to {0, 1, 2, 3, 4, 5, 6} mod 8.
%C Numbers n such that binary expansion does not end 111.
%C Complement of A004771. - _Michel Marcus_, Sep 11 2015
%H Daniel Starodubtsev, <a href="/A004777/b004777.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,1,-1).
%F G.f.: x^2*(1+x+x^2+x^3+x^4+x^5+2*x^6) / ((x^6+x^5+x^4+x^3+x^2+x+1)*(x-1)^2). - _R. J. Mathar_, Oct 08 2011
%F a(n) = floor((n-1)*8/7). - _M. F. Hasler_, Nov 02 2013
%F From _Wesley Ivan Hurt_, Sep 11 2015: (Start)
%F a(n) = a(n-1) + a(n-7) - a(n-8) for n>8.
%F a(n) = n - 1 + A132270(n). (End)
%F From _Wesley Ivan Hurt_, Jul 20 2016: (Start)
%F a(n) = (56*n - 77 + (n mod 7) + ((n+1) mod 7) + ((n+2) mod 7) + ((n+3) mod 7) + ((n+4) mod 7) + ((n+5) mod 7) - 6*((n+6) mod 7))/49.
%F a(7k) = 8k-2, a(7k-1) = 8k-3, a(7k-2) = 8k-4, a(7k-3) = 8k-5, a(7k-4) = 8k-6, a(7k-5) = 8k-7, a(7k-6) = 8k-8. (End)
%p A004777:=n->n-1+floor((n-1)/7): seq(A004777(n), n=1..100); # _Wesley Ivan Hurt_, Sep 11 2015
%t DeleteCases[Range[0,100],_?(Mod[#,8]==7&)] (* _Harvey P. Dale_, Apr 01 2011 *)
%t Select[Range[0, 100], ! MemberQ[{7}, Mod[#, 8]] &] (* _Vincenzo Librandi_, Sep 12 2015 *)
%o (PARI) A004777=n->(n-1)*8\7 \\ _M. F. Hasler_, Nov 02 2013
%o (Magma) [n-1+Floor((n-1)/7) : n in [1..100]]; // _Wesley Ivan Hurt_, Sep 11 2015
%o (Magma) [n: n in [0..100] | not n mod 8 in [7]]; // _Vincenzo Librandi_, Sep 11 2015
%Y Cf. A004771, A059561, A132270.
%K nonn,easy
%O 1,3
%A _N. J. A. Sloane_
%E Edited by _N. J. A. Sloane_ Aug 31 2009 at the suggestion of _R. J. Mathar_.