# Boolean cumulants k_2..k_62 from the model of Theorem 1.3, organised by polynomials in s (run 2)
# arithmetic: python-flint fmpq_poly (exact)
k[2] = 4/1
k[3] = 0/1
k[4] = 8/1
k[5] = 0/1
k[6] = 80/3
k[7] = 0/1
k[8] = 304/3
k[9] = 0/1
k[10] = 6112/15
k[11] = 0/1
k[12] = 25328/15
k[13] = 0/1
k[14] = 448864/63
k[15] = 0/1
k[16] = 212924/7
k[17] = 0/1
k[18] = 53017256/405
k[19] = 0/1
k[20] = 892403651/1575
k[21] = 0/1
k[22] = 128002786598/51975
k[23] = 0/1
k[24] = 10046430154837/935550
k[25] = 0/1
k[26] = 285431910217807/6081075
k[27] = 0/1
k[28] = 34999712108866997/170270100
k[29] = 0/1
k[30] = 8528071961408477/9459450
k[31] = 0/1
k[32] = 16177771238016527723/4086482400
k[33] = 0/1
k[34] = 1007385960150012820633/57891834000
k[35] = 0/1
k[36] = 13023254609951512394977/170131104000
k[37] = 0/1
k[38] = 47065183539671739422653/139675536000
k[39] = 0/1
k[40] = 7052046294803260043107381849/4751761734720000
k[41] = 0/1
k[42] = 65254985047174814083890376639/9978699642912000
k[43] = 0/1
k[44] = 21094080965008188144080522323117/731771307146880000
k[45] = 0/1
k[46] = 641793543259775580001076770753163/5049222019313472000
k[47] = 0/1
k[48] = 17878345332628602740314517266774067/31889823279874560000
k[49] = 0/1
k[50] = 18732519105009309430701833661034186313/7573833028970208000000
k[51] = 0/1
k[52] = 8596484635589959420142024142558342827593/787678635012901632000000
k[53] = 0/1
k[54] = 102435328132574536056931233935054359589683/2126732314534834406400000
k[55] = 0/1
k[56] = 12660073767456372627289933845198528684610007/59548504806975363379200000
k[57] = 0/1
k[58] = 71085722338892505388115701105180299175682009/75741519272030067456000000
k[59] = 0/1
k[60] = 82564858031097317556943904512055458628892805633/19925845839257140823040000000
k[61] = 0/1
k[62] = 73458350976802472174367282808838492822064577637327/4015057936610313875842560000000
# done; R-invariance tested for n <= 40 and on every 16th step
