|
Search: id:A138988
|
|
|
| A138988 |
|
a(n) = Frobenius number for 8 successive numbers = F(n+1,n+2,n+3,n+4,n+5,n+6,n+7,n+8). |
|
+0
16
|
|
| 1, 2, 3, 4, 5, 6, 7, 17, 19, 21, 23, 25, 27, 29, 47, 50, 53, 56, 59, 62, 65, 91, 95, 99, 103, 107, 111, 115, 149, 154, 159, 164, 169, 174, 179, 221, 227, 233, 239, 245, 251, 257, 307, 314, 321, 328, 335, 342, 349, 407, 415, 423, 431, 439, 447, 455, 521, 530, 539
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
For Frobenius numbers for 2 successive numbers see A028387
For Frobenius numbers for 3 successive numbers see A079326
For Frobenius numbers for 4 successive numbers see A138984
For Frobenius numbers for 5 successive numbers see A138985
For Frobenius numbers for 6 successive numbers see A138986
For Frobenius numbers for 7 successive numbers see A138987
For Frobenius numbers for 8 successive numbers see A138988
|
|
EXAMPLE
|
a(8)=17 because 17 is the biggest number k such that equation:
9*x_1+10*x_2+11*x_3+12*x_4+13*x_5+14*x_6+15*x_7+16*x_8 = k has no solution for any nonnegative x_i (in other words for every k>17 there exists one or more solutions)
|
|
MATHEMATICA
|
Table[FrobeniusNumber[{n + 1, n + 2, n + 3, n + 4, n + 5, n + 6, n + 7, n + 8}], {n, 1, 100}]
|
|
CROSSREFS
|
Cf. A028387, A079326, A138985, A138986, A138987, A138988.
Sequence in context: A085158 A065639 A039090 this_sequence A055520 A037342 A024644
Adjacent sequences: A138985 A138986 A138987 this_sequence A138989 A138990 A138991
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Artur Jasinski (grafix(AT)csl.pl), Apr 05 2008
|
|
|
Search completed in 0.002 seconds
|
