cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A133895 #4 Oct 13 2022 14:24:41
%S A133895 20,21,22,23,24,45,46,47,48,49,70,71,72,73,74,95,96,97,98,99,120,121,
%T A133895 122,123,124,145,146,147,148,149,170,171,172,173,174,195,196,197,198,
%U A133895 199,220,221,222,223,224,245,246,247,248,249,270,271,272,273,274,295
%N A133895 Numbers m such that binomial(m+5,m) mod 5 = 0.
%C A133895 Also numbers m such that floor(1+(m/5)) mod 5 = 0.
%C A133895 Partial sums of the sequence 20,1,1,1,1,21,1,1,1,1, 21, ... which has period 5.
%H A133895 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,1,-1).
%F A133895 a(n)=5n+20-4*(n mod 5).
%F A133895 G.f.: g(x)=(20+x+x^2+x^3+x^4+x^5)/((1-x^5)(1-x)).
%F A133895 G.f.: g(x)=(20-19x-x^6) /((1-x^5)(1-x)^2).
%Y A133895 Cf. A000040, A133620, A133621, A133623, A133630, A133635.
%Y A133895 Cf. A133875, A133885, A133890, A133900, A133910.
%K A133895 nonn,easy
%O A133895 0,1
%A A133895 _Hieronymus Fischer_, Oct 20 2007