|
Search: id:A053991
|
|
|
| A053991 |
|
Number of distinct residues of generalized Catalan number 1/((n^2-1)k+1){{n^2 k} choose k} modulo {n^2} as k runs through natural numbers. |
|
+0
1
|
| |
|
|
OFFSET
|
2,1
|
|
|
REFERENCES
|
F. Luca, P. Stanica, "Products of factorials modulo p", manuscript 2001.
|
|
LINKS
|
P. Stanica, On powerfree p^q-Catalan numbers
P. Stanica, p^q Catalan numbers and squarefree binomial coefficients
|
|
FORMULA
|
For p prime, p != 5, a(p) = p+1.
{1/((n^2-1)k+1){{n^2 k} choose {k}} modulo {n^2} | k\in N}
|
|
EXAMPLE
|
a(2)=3 since there are 3 residues of 1/((2^2-1)n+1){{2^2 n} choose {n}} modulo {2^2}, namely {0,1,2}.
|
|
CROSSREFS
|
Adjacent sequences: A053988 A053989 A053990 this_sequence A053992 A053993 A053994
Sequence in context: A057757 A058838 A001177 this_sequence A033957 A031131 A105321
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Pantelimon Stanica (pstanica(AT)mail.aum.edu), Apr 04 2000; corrected Feb 08 2001.
|
|
|
Search completed in 0.002 seconds
|
