This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A344340 #13 Jun 06 2021 15:49:58 %S A344340 0,0,0,0,0,0,1,1,2,3,4,6,1,4,4,6,5,7,3,7,4,8,6,10,2,7,6,9,6,9,2,9,5,9, %T A344340 7,9,2,8,7,10,5,9,3,10,6,8,7,10,3,9,6,10,6,10,4,9,6,9,8,11,1,9,7,11,7, %U A344340 8,3,10,7,10,6,10,2,10,8,9,6,9,4,11,5,9,7 %N A344340 Number of knapsack partitions of n with largest part 6. %C A344340 An integer partition is knapsack if every distinct submultiset has a different sum. %C A344340 I computed terms a(n) for n = 0..10000 and (6,10,6,10,4,9,6,9,8,11,1,9,7,11,7,8,3,10,7,10,6,10,2,10,8,9,6,9,4,11,5,9,7,11,3,8,7,10,7,10,2,10,6,10,8,9,2,9,8,11,5,9,3,11,7,8,7,10,3,10) is repeated continuously starting at a(50). %H A344340 Fausto A. C. Cariboni, <a href="/A344340/b344340.txt">Table of n, a(n) for n = 0..1000</a> %e A344340 The initial values count the following partitions: %e A344340 6: (6) %e A344340 7: (6,1) %e A344340 8: (6,1,1) %e A344340 8: (6,2) %e A344340 9: (6,1,1,1) %e A344340 9: (6,2,1) %e A344340 9: (6,3) %Y A344340 Cf. A108917, A275972, A326017, A326034, A343321, A344310. %K A344340 nonn %O A344340 0,9 %A A344340 _Fausto A. C. Cariboni_, May 15 2021