This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A227589 #17 Sep 13 2013 21:01:01 %S A227589 1,4,7,12,16,23,29,38,46,57,67,80,92,107,121,138,154,173,191,212,232 %N A227589 Maximum label within a minimal labeling of n identical 4-sided dice yielding the most possible sums. %F A227589 Conjecture: a(n) = (n^2 + 3n + 5 - (-1)^n)/2 for n > 1. %F A227589 Conjecture: a(n) = 2*a(n-1)-2*a(n-3)+a(n-4) for n>5. G.f.: (x^5-x^4-x^2+2*x+1) / ((x-1)^3*(x+1)). - _Colin Barker_, Aug 01 2013 %e A227589 Three tetrahedra labeled (1, 2, 8, 12) yield the 20 possible sums 3, 4, 5, 6, 10, 11, 12, 14, 15, 16, 17, 18, 21, 22, 24, 25, 26, 28, 32, 36. No more sums can be obtained by different labelings, and no labeling with labels < 12 yields 20 possible sums. Therefore a(3) = 12. %Y A227589 Row n=4 of array A227588. %K A227589 nonn,more %O A227589 0,2 %A A227589 _Jens Voß_, Jul 17 2013