Number of 4d partitions <=40

Back to the four-dim partitions page

This page will have results from the depth 6 run to determine the number of four-dimensional partitions for all positive integers $<=40.$

Predictions

We make predictions for the four-dim partitions of integers, $p_4(n)$, in the range $n\in [36,40]$ using a one-parameter fit, $q_3(n)$, that is chosen to give the exact answer for $n=35$. The prediction is being made on Sun Jul 3 16:26:10 IST 2011. Exact numbers for 36, 37 obtained on July 4 using a depth 12 run. Results from the depth 6 run obtained on July 13, 2011.

$n$ 35 36 37 38 39 40
$q_4(n)$ used for fit 7383955608934 14865925276260 29815471230558 59578315944924 118625717447173
$p_4(n)$ 3653256942840 7375178344373 14833679265311 29727028383070 59363454021280 118137556912895

Results

This is sequence A000334 in the OEIS. Here are the results using v2.0 of the 4d code. This adds five numbers that will be eventually contributed to the OEIS.

c[N] = no. of 4d partitions of N
c = 1
c = 5
c = 15
c = 45
c = 120
c = 326
c = 835
c = 2145
c = 5345
c = 13220
c = 32068
c = 76965
c = 181975
c = 425490
c = 982615
c = 2245444
c = 5077090
c = 11371250
c = 25235790
c = 55536870
c = 121250185
c = 262769080
c = 565502405
c = 1209096875
c = 2569270050
c = 5427963902
c = 11404408525
c = 23836421895
c = 49573316740
c = 102610460240
c = 211425606778
c = 433734343316
c = 886051842960
c = 1802710594415
c = 3653256942840
c = 7375178344373
c = 14833679265311
c = 29727028383070
c = 59363454021280
c = 118137556912895

Page maintained by Suresh Govindarajan