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”).

Numbers m such that binomial(m+8,m) mod 8 = 0.
0

%I #5 Oct 13 2022 13:57:32

%S 56,57,58,59,60,61,62,63,120,121,122,123,124,125,126,127,184,185,186,

%T 187,188,189,190,191,248,249,250,251,252,253,254,255,312,313,314,315,

%U 316,317,318,319,376,377,378,379,380,381,382,383,440,441,442,443,444

%N Numbers m such that binomial(m+8,m) mod 8 = 0.

%C Partial sums of the sequence 56,1,1,1,1,1,1,1,57,1,1,1,1,1,1,1,57, ... which has period 8.

%H <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,1,-1).

%F a(n)=8n+56-7*(n mod 8). [Corrected by _Charles R Greathouse IV_, Oct 13 2022]

%F G.f.: g(x)=(56+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8)/((1-x^8)(1-x)).

%F G.f.: g(x)=(56-55x-x^9) /((1-x^8)(1-x)^2).

%o (PARI) a(n)=8*n+56-n%8*7 \\ _Charles R Greathouse IV_, Oct 13 2022

%Y Cf. A000040, A133620, A133621, A133623, A133630, A133635.

%Y Cf. A133878, A133888, A133890, A133900, A133910.

%K nonn,easy

%O 0,1

%A _Hieronymus Fischer_, Oct 20 2007