A039744 - cp's OEIS frontend

A039744 Number of ways n(n-1) can be partitioned into the sum of 2(n-1) integers in the range 0..n.

n	a(n)
0	1
1	1
2	2
3	5
4	18
5	73
6	338
7	1656
8	8512
9	45207
10	246448
11	1371535
12	7764392
13	44585180
14	259140928
15	1521967986
16	9020077206
17	53885028921
18	324176252022
19	1962530559999
20	11947926290396
21	73108804084505
22	449408984811980
23	2774152288318052
24	17190155366056138
25	106894140685782646

[1, 1, 2, 5, 18, 73, 338, 1656, 8512, 45207, 246448, 1371535, 7764392, 44585180, 259140928, 1521967986, 9020077206, 53885028921, 324176252022, 1962530559999, 11947926290396, 73108804084505, 449408984811980, 2774152288318052, 17190155366056138, 106894140685782646]

cp's OEIS Frontend

A039744 Number of ways n(n-1) can be partitioned into the sum of 2(n-1) integers in the range 0..n.

Table of values

List of values

cp's OEIS Frontend

A039744 Number of ways n*(n-1) can be partitioned into the sum of 2*(n-1) integers in the range 0..n.

Table of values

List of values

A039744 Number of ways n(n-1) can be partitioned into the sum of 2(n-1) integers in the range 0..n.