login
This site is supported by donations to The OEIS Foundation.

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A138992 a(n) = Frobenius number for 6 successive primes = F[p(n),p(n+1),p(n+2),p(n+3),p(n+4),p(n+5)]. 11
1, 4, 9, 16, 31, 41, 64, 63, 102, 143, 169, 216, 203, 264, 304, 381, 470, 502, 538, 562, 592, 638, 769, 989, 1360, 1008, 929, 961, 995, 1051, 1530, 1582, 1777, 1694, 2084, 2140, 2369, 2288, 2527, 2778, 3399, 2721, 2859, 2698, 2756, 3035, 3613, 5800, 4765 (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

Table of n, a(n) for n=1..49.

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 = 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]}], {n, 1, 100}]

CROSSREFS

Cf. A028387, A037165, A079326, A138985, A138986, A138987, A138988, A138989, A138990, A138991, A138992, A138993, A138994.

Sequence in context: A161328 A073141 A093175 * A199936 A007679 A239870

Adjacent sequences:  A138989 A138990 A138991 * A138993 A138994 A138995

KEYWORD

nonn

AUTHOR

Artur Jasinski, Apr 05 2008

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified April 17 20:01 EDT 2014. Contains 240655 sequences.