A258297
Number of partitions of n*(n+1)*(n+2) into parts that are at most n.
Original entry on oeis.org
1, 1, 13, 331, 13561, 776594, 57773582, 5320252480, 586352480958, 75438829494131, 11116206652400681, 1848033852642973772, 342436117841931383400, 70020229273505952925559, 15667865938977592230047929, 3809417116914053901413289249, 1000291703885548521424635046427
Offset: 0
-
T:=proc(n,k) option remember; `if`(n=0 or k=1, 1, T(n,k-1) + `if`(n
A258298
Number of partitions of n*(n+1)*(n+2)/6 into parts that are at most n.
Original entry on oeis.org
1, 1, 3, 14, 108, 1115, 14800, 239691, 4602893, 102442041, 2596767156, 73937412122, 2338157235782, 81358388835166, 3090548185022616, 127310130911561966, 5654266354725389764, 269396637045530725099, 13708631585852580662781, 742141584297248778501411
Offset: 0
-
T:=proc(n,k) option remember; `if`(n=0 or k=1, 1, T(n,k-1) + `if`(n
A258300
Number of partitions of n*(n-1)*(n-2)/6 into parts that are at most n.
Original entry on oeis.org
1, 1, 1, 1, 5, 30, 282, 3539, 55974, 1065947, 23785645, 608889106, 17594781914, 566603884871, 20123663539549, 781500841147604, 32946304088342094, 1498526109256063585, 73147202427442412812, 3814178439827570160925, 211598573411998923138880
Offset: 0
-
T:=proc(n,k) option remember; `if`(n=0 or k=1, 1, T(n,k-1) + `if`(n
A258301
Number of partitions of n*(n+1)*(2n+1)/6 into parts that are at most n.
Original entry on oeis.org
1, 1, 3, 24, 297, 5260, 123755, 3648814, 129828285, 5425234114, 260818130929, 14194798070042, 863357482347465, 58068803644110427, 4281318749672322843, 343463734454952001605, 29792472711307060688049, 2778959190056157071592315, 277420695604265258419161136
Offset: 0
-
T:=proc(n,k) option remember; `if`(n=0 or k=1, 1, T(n,k-1) + `if`(n
Showing 1-4 of 4 results.