|
Search: id:A138986
|
|
|
| A138986 |
|
a(n) = Frobenius number for 6 successive numbers = F(n+1,n+2,n+3,n+4,n+5,n+6). |
|
+0
15
|
|
| 1, 2, 3, 4, 5, 13, 15, 17, 19, 21, 35, 38, 41, 44, 47, 67, 71, 75, 79, 83, 109, 114, 119, 124, 129, 161, 167, 173, 179, 185, 223, 230, 237, 244, 251, 295, 303, 311, 319, 327, 377, 386, 395, 404, 413, 469, 479, 489, 499, 509, 571, 582, 593, 604, 615, 683, 695, 707
(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(6)=13 because 11 is the biggest number k such that equation:
7*x_1+8*x_2+9*x_3+10*x_4+11*x_5+12*x_6 = k has no solution for any nonnegative x_i (in other words for every k>13 there exists one or more solutions)
|
|
MATHEMATICA
|
Table[FrobeniusNumber[{n + 1, n + 2, n + 3, n + 4, n + 5, n + 6}], {n, 1, 100}]
|
|
CROSSREFS
|
Cf. A028387, A079326, A138985, A138986, A138987, A138988.
Adjacent sequences: A138983 A138984 A138985 this_sequence A138987 A138988 A138989
Sequence in context: A039039 A141484 A057158 this_sequence A098552 A037340 A096774
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Artur Jasinski (grafix(AT)csl.pl), Apr 05 2008
|
|
|
Search completed in 0.002 seconds
|
