[go: up one dir, main page]

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

Showing entries 1-10 | older changes
Number of 4-tuples of nonnegative integers less than p for which 4-argument multinomial coefficients support a Lucas congruence modulo p^2, where p is the n-th prime.
(history; published version)
#24 by N. J. A. Sloane at Mon Dec 27 11:04:53 EST 2021
STATUS

proposed

approved

#23 by Jon E. Schoenfield at Wed Nov 24 22:42:44 EST 2021
STATUS

editing

proposed

Discussion
Mon Nov 29
03:52
Michel Marcus: Mma uses p*(p - 1)*(p^2 - p - 1)/2; does it need to be explained in a comment ?
#22 by Jon E. Schoenfield at Wed Nov 24 22:42:41 EST 2021
NAME

Number of 4-tuples of nonnegative integers less than p for which 4 -argument multinomial coefficients support a Lucas congruence modulo p^2, where p is the n-th prime.

STATUS

proposed

editing

#21 by Joshua Crisafi at Wed Nov 24 13:43:41 EST 2021
STATUS

editing

proposed

#20 by Joshua Crisafi at Wed Nov 24 13:40:24 EST 2021
NAME

Number of 4-tuples of base-nonnegative integers less than p digits for which 4 argument multinomial coefficients support a Lucas congruence modulo p^2, where p is the n-th prime.

#19 by Joshua Crisafi at Wed Nov 24 13:39:28 EST 2021
EXAMPLE

For n = 2, p will be 3, and there are exactly a(2) = 20 4-tuples of the form (r, s, t, u) that satisfy the desired properties that 0 <= r, s, t, u <= 2 and either H(r) = H(s) = H(t) = H(u) = H(r + s + t + u) mod 3, where H(n) is the n-th harmonic number, or r + s + t + u >= 6: (0, 0, 0, 0), (0, 0, 0, 2), (0, 0, 2, 0), (0, 2, 0, 0), (0, 2, 2, 2), (1, 1, 2, 2), (1, 2, 1, 2), (1, 2, 2, 1), (1, 2, 2, 2), (2, 0, 0, 0), (2, 0, 2, 2), (2, 1, 1, 2), (2, 1, 2, 1), (2, 1, 2, 2), (2, 2, 0, 2), (2, 2, 1, 1), (2, 2, 1, 2), (2, 2, 2, 0), (2, 2, 2, 1), and (2, 2, 2, 2).

#18 by Joshua Crisafi at Wed Nov 24 13:34:01 EST 2021
NAME

Number of 4-tuples of base-p digits for which 4 argument multinomial coefficients support a Lucas congruence modulo p^2, where p is the n-th prime.

EXAMPLE

For n = 2, p will be 3, and there are exactly a(2) = 20 triples 4-tuples of the form (r, s, t, u) that satisfy the desired properties that 0 <= r, s, t, u <= 2 and either H(r) = H(s) = H(t) = H(u) = H(r + s + t + u) mod 3, where H(n) is the n-th harmonic number, or r + s + t + u >= 6.

STATUS

proposed

editing

#17 by Joshua Crisafi at Wed Nov 24 08:44:14 EST 2021
STATUS

editing

proposed

Discussion
Wed Nov 24
11:05
Michel Marcus: what is "base-p" digits ??
#16 by Joshua Crisafi at Wed Nov 24 08:44:11 EST 2021
COMMENTS

This sequence stems from the property of the multinomial function that states that multinomial(p*a + r, p*b + s, p*c + t, p*d + u) = binomialmultinomial(a, b, c, d) * binomialmultinomial(r, s, t, u) mod p for all a >= 0, b >= 0, c >= 0, d >= 0, and r, s, t, u in the set {0, 1, ..., p-1}. a(n) is the number of such 4-tuples (r, s, t, u) for which this congruence also holds modulo p^2 for all a >= 0, b >= 0, c >= 0, and d >= 0, where p is the n-th prime.

EXAMPLE

For n = 2, p will be 3, and there are exactly a(2) = 20 triples of the form (r, s, t, u) that satisfy the desired properties that 0 <= r, s, t, u <= 4 2 and either H(r) = H(s) = H(t) = H(u) = H(r + s + t + u) mod 3, where H(n) is the n-th harmonic number, or r + s + t + u >= 6.

STATUS

proposed

editing

#15 by Jon E. Schoenfield at Tue Nov 23 23:48:42 EST 2021
STATUS

editing

proposed