Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Jun 06 2021 08:16:28
%S 0,0,0,0,0,0,0,1,1,2,3,4,6,7,1,6,5,8,7,10,8,8,9,11,8,13,11,13,5,14,8,
%T 13,10,17,12,8,10,14,13,14,12,18,3,15,11,15,14,17,12,8,12,15,13,20,12,
%U 14,5,17,15,17,10,18,14,9,13,18,13,15,15,18,5,18,11
%N Number of knapsack partitions of n with largest part 7.
%C An integer partition is knapsack if every distinct submultiset has a different sum.
%C I computed terms a(n) for n = 0..25000 and the subsequence a(72)-a(491) of length 420 is repeated continuously.
%H Fausto A. C. Cariboni, <a href="/A344412/b344412.txt">Table of n, a(n) for n = 0..1000</a>
%e The initial nonzero values count the following partitions:
%e 7: (7)
%e 8: (7,1)
%e 9: (7,1,1), (7,2)
%e 10: (7,1,1,1), (7,2,1), (7,3)
%Y Cf. A108917, A275972, A326017, A326034, A343321, A344310, A344340.
%K nonn
%O 0,10
%A _Fausto A. C. Cariboni_, May 17 2021