|
Search: id:A138990
|
|
|
| A138990 |
|
a(n) = Frobenius number for 4 successive primes = F[p(n),p(n+1),p(n+2),p(n+4)]. |
|
+0
10
|
|
| 1, 4, 9, 23, 42, 67, 83, 101, 125, 199, 262, 335, 367, 393, 492, 593, 704, 807, 873, 990, 817, 950, 1101, 1353, 2039, 2624, 2371, 1494, 1431, 1640, 2927, 2368, 2875, 2667, 3570, 3348, 3625, 3918, 4531, 3816, 4831, 4543, 9357, 4819, 4131, 6611, 5735, 10483
(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(3)=23 because 23 is the largest number k such that equation 7*x_1+11*x_2+13*x_3+17*x+4 = k has no solution for any nonnegative x_i (in other words for every k>23 there exists one or more solutions)
|
|
MATHEMATICA
|
Table[FrobeniusNumber[{Prime[n], Prime[n + 1], Prime[n + 2], Prime[n + 3]}], {n, 1, 100}]
|
|
CROSSREFS
|
Cf. A028387, A037165, A079326, A138985, A138986, A138987, A138988, A138989, A138990, A138991, A138992, A138993, A138994.
Adjacent sequences: A138987 A138988 A138989 this_sequence A138991 A138992 A138993
Sequence in context: A070713 A060250 A138991 this_sequence A014543 A131607 A027119
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Artur Jasinski (grafix(AT)csl.pl), Apr 05 2008
|
|
|
Search completed in 0.002 seconds
|
