|
| |
|
|
A099906
|
|
C(2n-1,n-1) mod n^2.
|
|
3
| |
|
|
0, 3, 1, 3, 1, 30, 1, 35, 10, 78, 1, 62, 1, 52, 135, 35, 1, 138, 1, 10, 402, 124, 1, 270, 126, 172, 253, 476, 1, 812, 1, 291, 978, 870, 616, 674, 1, 364, 10, 410, 1, 756, 1, 1124, 1260, 532, 1, 1422, 1716, 1128, 2322, 1556, 1, 1920, 1941, 2172, 1815, 844, 1, 3528, 1, 964
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| For p prime, Charles Babbage showed in 1819 a(p)=1.
|
|
|
EXAMPLE
| a(11) =352716 mod 121 =1.
|
|
|
MATHEMATICA
| Table[ Mod[ Binomial[2n - 1, n - 1], n^2], {n, 60}] (from Robert G. Wilson v Dec 14 2004)
|
|
|
CROSSREFS
| Cf. A088218, A099905, A099907, A099908.
Sequence in context: A146431 A115716 A079412 * A047787 A102668 A057741
Adjacent sequences: A099903 A099904 A099905 * A099907 A099908 A099909
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Henry Bottomley (se16(AT)btinternet.com), Oct 29 2004
|
| |
|
|
