|
|
A060545
|
|
a(n) = binomial(n^2, n)/n.
|
|
9
|
|
|
1, 3, 28, 455, 10626, 324632, 12271512, 553270671, 28987537150, 1731030945644, 116068178638776, 8634941152058949, 705873715441872264, 62895036884524942320, 6067037854078498539696, 629921975126394617164575, 70043473196734767582082230
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
a(p^r) == 1 (mod p^(3+r)) for all positive integers r and all primes p >= 5 (apply Meštrović, Remark 17, p. 12).
Conjecture: a(2*p^r) == 4*p^r - 1 (mod p^(3+r)) for all positive integers r and all primes p >= 5. (End)
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|