|
|
A099906
|
|
a(n) = binomial(2n-1,n-1) mod n^2.
|
|
7
|
|
|
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;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
For odd primes p, Charles Babbage showed in 1819 that a(p) = 1.
|
|
LINKS
|
|
|
EXAMPLE
|
a(11) = binomial(21,10) mod 11^2 = 352716 mod 121 = 1.
|
|
MATHEMATICA
|
|
|
PROG
|
(Magma) [Binomial(2*n-1, n-1) mod(n^2): n in [1..65]]; // Vincenzo Librandi, Jul 29 2015
(Python)
from __future__ import division
for n in range(1, 10001):
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|