The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A138990 a(n) = Frobenius number for 4 successive primes = F[p(n),p(n+1),p(n+2),p(n+3)]. 11
 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; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS 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 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 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}] FrobeniusNumber/@Partition[Prime[Range[60]], 4, 1] (* Harvey P. Dale, Nov 23 2014 *) CROSSREFS Cf. A028387, A037165, A079326, A138985, A138986, A138987, A138988, A138989, A138990, A138991, A138992, A138993, A138994. Sequence in context: A070713 A060250 A138991 * A014543 A131607 A221313 Adjacent sequences:  A138987 A138988 A138989 * A138991 A138992 A138993 KEYWORD nonn AUTHOR Artur Jasinski, Apr 05 2008 EXTENSIONS Definition corrected by Harvey P. Dale, Aug 15 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 16 16:00 EST 2020. Contains 331961 sequences. (Running on oeis4.)