[go: up one dir, main page]

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

Showing entries 1-10 | older changes
Irregular triangle read by rows: T(n, {j,k}) is the number of partitions of n that have exactly j parts equal to k; 1 <= j <= n, 1 <= k <= n.
(history; published version)
#41 by Alois P. Heinz at Mon Sep 25 14:34:15 EDT 2023
STATUS

proposed

approved

#40 by Robert C. Lyons at Mon Sep 25 14:30:32 EDT 2023
STATUS

editing

proposed

#39 by Robert C. Lyons at Mon Sep 25 14:30:29 EDT 2023
PROG

(PYTHONPython) # See Stauduhar link.

STATUS

approved

editing

#38 by N. J. A. Sloane at Mon May 24 00:38:00 EDT 2021
PROG

(PythonPYTHON) # See Stauduhar link.

KEYWORD

nonn,tabf,changed

STATUS

proposed

approved

#37 by F. Chapoton at Sun May 23 14:31:28 EDT 2021
STATUS

editing

proposed

Discussion
Sun May 23
14:43
Rémy Sigrist: I think that it's not necessary to do this; see https://oeis.org/wiki/Style_Sheet#Programs
15:20
F. Chapoton: I see. But the aim here is to be able to automatically check all python blocks. This requires at minimum that every such block is a valid python program.
17:10
Rémy Sigrist: maybe ignore one-line python program starting with "See"
#36 by F. Chapoton at Sun May 23 14:31:20 EDT 2021
PROG

(PYTHONPython) # See Stauduhar link.

STATUS

approved

editing

Discussion
Sun May 23
14:31
F. Chapoton: add comment mark in python code
#35 by N. J. A. Sloane at Sat Mar 03 14:06:19 EST 2018
STATUS

proposed

approved

#34 by J. Stauduhar at Sat Mar 03 13:15:56 EST 2018
STATUS

editing

proposed

#33 by J. Stauduhar at Sat Mar 03 13:15:36 EST 2018
LINKS

J. Stauduhar, <a href="/A300185/b300185.txt">Table of n, a(n) for n = 1..10000</a>

STATUS

approved

editing

#32 by N. J. A. Sloane at Sat Mar 03 12:47:23 EST 2018
STATUS

editing

approved