|
Search: id:A138994
|
|
|
| A138994 |
|
a(n) = Frobenius number for 8 successive primes = F[p(n),p(n+1),p(n+2),p(n+3),p(n+4),p(n+5),p(n+6),p(n+7)]. |
|
+0
11
|
|
| 1, 4, 9, 16, 27, 35, 49, 63, 102, 114, 138, 150, 162, 221, 257, 275, 352, 368, 398, 424, 452, 559, 686, 633, 772, 705, 723, 747, 777, 938, 1149, 1189, 1231, 1406, 1637, 1536, 1741, 1799, 2193, 1913, 1967, 1824, 2099, 2125, 2165, 2438, 2769, 3347, 3403, 3212
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
For Frobenius numbers for 2 successive primes see A037165
For Frobenius numbers for 3 successive primes see A138989
For Frobenius numbers for 4 successive primes see A138990
For Frobenius numbers for 5 successive primes see A138991
For Frobenius numbers for 6 successive primes see A138992
For Frobenius numbers for 7 successive primes see A138993
For Frobenius numbers for 8 successive primes see A138994
|
|
EXAMPLE
|
a(4)=16 because 16 is the biggest number k such that equation:
7*x_1+11*x_2+13*x_3+17*x+4+19*x_5+23*x_6 +29*x_7+31*x_8 = k has no solution for any nonnegative x_i (in other words for every k>16 there exists one or more solutions)
|
|
MATHEMATICA
|
Table[FrobeniusNumber[{Prime[n], Prime[n + 1], Prime[n + 2], Prime[n + 3], Prime[n + 4], Prime[n + 5], Prime[n + 6], Prime[n + 7]}], {n, 1, 100}]
|
|
CROSSREFS
|
Cf. A028387, A037165, A079326, A138985, A138986, A138987, A138988, A138989, A138990, A138991, A138992, A138993, A138994.
Sequence in context: A009875 A027365 A100216 this_sequence A066969 A109593 A138981
Adjacent sequences: A138991 A138992 A138993 this_sequence A138995 A138996 A138997
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Artur Jasinski (grafix(AT)csl.pl), Apr 05 2008
|
|
|
Search completed in 0.002 seconds
|
