In mathematics, Alcuin's sequence, named after Alcuin of York, is the sequence of coefficients of the power-series expansion of:[1]
| x3 | |
| (1-x2)(1-x3)(1-x4) |
=x3+x5+x6+2x7+x8+3x9+ … .
The sequence begins with these integers:
0, 0, 0, 1, 0, 1, 1, 2, 1, 3, 2, 4, 3, 5, 4, 7, 5, 8, 7, 10, 8, 12, 10, 14, 12, 16, 14, 19, 16, 21
The nth term is the number of triangles with integer sides and perimeter n.[1] It is also the number of triangles with distinct integer sides and perimeter n + 6, i.e. number of triples (a, b, c) such that 1 ≤ a < b < c < a + b, a + b + c = n + 6.
If one deletes the three leading zeros, then it is the number of ways in which n empty casks, n casks half-full of wine and n full casks can be distributed to three persons in such a way that each one gets the same number of casks and the same amount of wine. This is the generalization of problem 12 appearing in Propositiones ad Acuendos Juvenes ("Problems to Sharpen the Young") usually attributed to Alcuin. That problem is given as,
Problem 12: A certain father died and left as an inheritance to his three sons 30 glass flasks, of which 10 were full of oil, another 10 were half full, while another 10 were empty. Divide the oil and flasks so that an equal share of the commodities should equally come down to the three sons, both of oil and glass.[2]
In Latin: "XII. Propositio de quodam paterfamilias et tribus filius eius : Quidam paterfamilias moriens dimisit haereditatem tribus filiis suis, XXX ampullas uitreas, quarum decem fuerunt plenae oleo. Aliae decem dimidiae. Tertiae decem uacuae. Diuidat, qui potest, oleum et ampullas ut unicuique eorum de tribus filiis aequaliter obueniat tam de uitro, quam de oleo."[3]
The term "Alcuin's sequence" may be traced back to D. Olivastro's 1993 book on mathematical games, Ancient Puzzle: Classical Brainteasers and Other Timeless Mathematical Games of the Last 10 Centuries (Bantam, New York).
The sequence with the three leading zeros deleted is obtained as the sequence of coefficients of the power-series expansion of[4]
| 1 | |
| (1-x2)(1-x3)(1-x4) |
=1+x2+x3+2x4+x5+3x6+ … .