%I A138984
%S A138984 1,2,3,9,11,13,23,26,29,43,47,51,69,74,79,101,107,113,139,146,153,183,
%T A138984 191,199,233,242,251,289,299,309,351,362,373,419,431,443,493,506,519,
%U A138984 573,587,601,659,674,689,751,767,783,849,866,883,953,971,989,1063,1082
%N A138984 a(n) = Frobenius number for 4 successive numbers = F(n+1,n+2,n+3,n+4).
%C A138984 For Frobenius numbers for 2 successive numbers see A028387
%C A138984 For Frobenius numbers for 3 successive numbers see A079326
%C A138984 For Frobenius numbers for 4 successive numbers see A138984
%C A138984 For Frobenius numbers for 5 successive numbers see A138985
%C A138984 For Frobenius numbers for 6 successive numbers see A138986
%C A138984 For Frobenius numbers for 7 successive numbers see A138987
%C A138984 For Frobenius numbers for 8 successive numbers see A138988
%e A138984 a(4)=9 because 9 is the biggest number k such that equation:
%e A138984 5*x_1+6*x_2+7*x_3+9*x_4 = k has no solution for any nonnegative x_i
%e A138984 (in other words for every k>9 there exists one or more solutions)
%t A138984 Table[FrobeniusNumber[{n + 1, n + 2, n + 3, n + 4}], {n, 1, 100}]
%Y A138984 Cf. A028387, A079326, A138985, A138986, A138987, A138988.
%Y A138984 Sequence in context: A103039 A140222 A121557 this_sequence A110772 A074338 
               A111319
%Y A138984 Adjacent sequences: A138981 A138982 A138983 this_sequence A138985 A138986 
               A138987
%K A138984 nonn
%O A138984 1,2
%A A138984 Artur Jasinski (grafix(AT)csl.pl), Apr 05 2008