[go: up one dir, main page]

login
Revision History for A001459 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) = (5*n)!/((2*n)!*(2*n)!*n!).
(history; published version)
#36 by Jon E. Schoenfield at Thu Feb 03 00:51:09 EST 2022
STATUS

editing

approved

#35 by Jon E. Schoenfield at Thu Feb 03 00:51:08 EST 2022
AUTHOR
STATUS

approved

editing

#34 by N. J. A. Sloane at Wed Oct 06 14:26:09 EDT 2021
FORMULA

SupercongruencesCongruences: a(n*p^k) == a(n*p^(k-1)) ( mod p^(3*k) ) for any prime p >= 5 and any positive integers n and k (write a(n) as C(5*n,2*n)*C(3*n,n) and apply Mestrovic, equation 39, p. 12). (End)

Discussion
Wed Oct 06
14:26
OEIS Server: https://oeis.org/edit/global/2913
#33 by Alois P. Heinz at Tue Sep 21 19:40:33 EDT 2021
STATUS

editing

approved

#32 by Alois P. Heinz at Tue Sep 21 19:40:30 EDT 2021
DATA

1, 30, 3150, 420420, 62355150, 9816086280, 1605660228900, 269764879032000, 46225898052627150, 8042050347997165500, 1415997888807961859400, 251762943910387780962000, 45125969443194371927422500, 8143514687130622653091029120, 1478138194032735032800001630400

STATUS

approved

editing

#31 by Alois P. Heinz at Tue Sep 21 19:38:41 EDT 2021
STATUS

proposed

approved

#30 by Michel Marcus at Tue Sep 21 17:25:54 EDT 2021
STATUS

editing

proposed

#29 by Michel Marcus at Tue Sep 21 17:25:50 EDT 2021
FORMULA

Supercongruences: a(n*p^k) == a(n*p^(k-1)) ( mod p^(3*k) ) for any prime p >= 5 and any positive integers n and k (write a(n) as C(5*n,2*n)*C(3*n,n) and apply Mestrovoc, Mestrovic, equation 39, p. 12). (End)

STATUS

proposed

editing

#28 by Peter Bala at Tue Sep 21 16:32:15 EDT 2021
STATUS

editing

proposed

#27 by Peter Bala at Tue Sep 21 15:03:47 EDT 2021
LINKS

R. Mestrovic, Romeo Meštrović, <a href="http://arxiv.org/abs/1111.3057">Wolstenholme's theorem: Its Generalizations and Extensions in the last hundred and fifty years (1862-2011)</a>, arXiv:1111.3057 [math.NT], 2011.

FORMULA

Supercongruences: a(n*p^k) == a(n*p^(k-1)) ( mod p^(3*k) ) for any prime p >= 5 and any positive integers n and k (write a(n) as C(5*n,2*n)*C(3*n,n) and apply Mestrovoc, equation 39, p. 12). (End)

(End)