[go: up one dir, main page]

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

Showing entries 1-10 | older changes
Number A(n,k) of n-element subsets of [k*n] whose elements sum to a multiple of n. Square array A(n,k) with n, k >= 0 read by antidiagonals.
(history; published version)
#37 by OEIS Server at Sun Jan 07 14:15:02 EST 2024
LINKS

Andrew Howroyd, <a href="/A304482/b304482_1.txt">Table of n, a(n) for n = 0..1325</a> (first 51 antidiagonals)

#36 by Michel Marcus at Sun Jan 07 14:15:02 EST 2024
STATUS

reviewed

approved

Discussion
Sun Jan 07
14:15
OEIS Server: Installed first b-file as b304482.txt.
#35 by Hugo Pfoertner at Sun Jan 07 12:56:37 EST 2024
STATUS

proposed

reviewed

#34 by Andrew Howroyd at Sun Jan 07 12:46:22 EST 2024
STATUS

editing

proposed

#33 by Andrew Howroyd at Sun Jan 07 12:25:35 EST 2024
LINKS

Andrew Howroyd, <a href="/A304482/b304482_1.txt">Table of n, a(n) for n = 0..1325</a> (first 51 antidiagonals)

STATUS

approved

editing

#32 by Alois P. Heinz at Mon Sep 23 08:09:44 EDT 2019
STATUS

proposed

approved

#31 by Jean-François Alcover at Mon Sep 23 07:02:02 EDT 2019
STATUS

editing

proposed

#30 by Jean-François Alcover at Mon Sep 23 07:01:58 EDT 2019
MATHEMATICA

A[n_, k_] : = (-1)^n (1/n) Sum[Binomial[k d, d] (-1)^d EulerPhi[n/d], {d, Divisors[n]}]; A[0, 0] = 1; A[_, 0] = 0; A[0, _] = 1;

Table[A[n-k, k], {n, 0, 11}, {k, n, 0, -1}] // Flatten (* Jean-François Alcover, Sep 23 2019 *)

STATUS

approved

editing

#29 by Alois P. Heinz at Wed Aug 29 17:46:42 EDT 2018
STATUS

editing

approved

#28 by Alois P. Heinz at Wed Aug 29 17:46:37 EDT 2018
STATUS

approved

editing