A138999 First differences of Frobenius numbers for 8 successive numbers A138988.
1, 1, 1, 1, 1, 1, 10, 2, 2, 2, 2, 2, 2, 18, 3, 3, 3, 3, 3, 3, 26, 4, 4, 4, 4, 4, 4, 34, 5, 5, 5, 5, 5, 5, 42, 6, 6, 6, 6, 6, 6, 50, 7, 7, 7, 7, 7, 7, 58, 8, 8, 8, 8, 8, 8, 66, 9, 9, 9, 9, 9, 9, 74, 10, 10, 10, 10, 10, 10, 82, 11, 11, 11, 11, 11, 11, 90, 12, 12, 12, 12, 12, 12, 98, 13, 13, 13, 13
Offset: 1
Keywords
Links
- Harvey P. Dale, Table of n, a(n) for n = 1..1000
Crossrefs
Programs
-
Mathematica
a = {}; Do[AppendTo[a, FrobeniusNumber[{n + 1, n + 2, n + 3, n + 4, n + 5, n + 6, n + 7, n + 8}]], {n, 1, 100}]; Differences[a] Differences[Table[FrobeniusNumber[Range[n,n+7]],{n,2,90}]] (* Harvey P. Dale, Oct 02 2011 *)
Formula
From R. J. Mathar, Apr 20 2008: (Start)
G.f.: -(-1-x-x^2-x^3-x^4-x^5-10*x^6+2*x^13)/((x-1)^2*(x^6+x^5+x^4+x^3+x^2+x+1)^2).
a(n) = 2*a(n-7) - a(n-14).
(End)
a(n) = -(1/7)*mod(n,7)*x(7+mod(n,7))+(1/7)*mod(n,7)*x(mod(n,7))+x(mod(n,7))-(1/7)*n *x(mod(n,7))+(1/7)*n*x(7+mod(n,7)). - Alexander R. Povolotsky, Apr 20 2008
Comments