login
A113052
Binomial(5n,n)/(4n+1) mod 5.
1
1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
OFFSET
0,1
COMMENTS
Conjecture: for p prime, mod(C(p*n,n)/((p-1)*n+1),p) is the indicator function of the sequence (p^k-1)/(p-1).
Conjecture is true: see link. - Robert Israel, Jun 11 2018
LINKS
MAPLE
V:= Vector(1+(5^4-1)/4):
V[[seq(1+(5^k-1)/4, k=0..4)]]:= 1:
convert(V, list); # Robert Israel, Jun 11 2018
MATHEMATICA
Array[Mod[Binomial[5 #, #]/(4 # + 1), 5] &, 105, 0] (* Michael De Vlieger, Jun 11 2018 *)
CROSSREFS
Sequence in context: A011642 A016338 A266253 * A369967 A256432 A218171
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Oct 12 2005
STATUS
approved