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 A343321 #34 Jun 06 2021 15:50:11 %S A343321 0,0,0,0,0,1,1,2,3,4,1,4,3,5,5,4,4,6,5,7,2,6,5,8,5,4,6,7,6,8,2,8,6,7, %T A343321 7,5,5,8,7,8,2,8,6,9,6,3,7,9,5,8,3,8,6,8,6,5,6,7,7,9,1,8,7,8,6,4,6,9, %U A343321 6,7,3,9,5,8,7,4,6,8,6,9,2,7,7,9,5,4,7 %N A343321 Number of knapsack partitions of n with largest part 5. %C A343321 An integer partition is knapsack if every distinct submultiset has a different sum. %C A343321 I computed terms a(n) for n = 0..10000 and (6,7,7,5,5,8,7,8,2,8,6,9,6,3,7,9,5,8,3,8,6,8,6,5,6,7,7,9,1,8,7,8,6,4,6,9,6,7,3,9,5,8,7,4,6,8,6,9,2,7,7,9,5,4,7,8,6,8,2,9) is repeated continuously starting at a(32). %H A343321 Fausto A. C. Cariboni, <a href="/A343321/b343321.txt">Table of n, a(n) for n = 0..1000</a> %e A343321 The initial values count the following partitions: %e A343321 5: (5) %e A343321 6: (5,1) %e A343321 7: (5,1,1) %e A343321 7: (5,2) %e A343321 8: (5,1,1,1) %e A343321 8: (5,2,1) %e A343321 8: (5,3) %Y A343321 Cf. A108917, A275972, A326017, A326034, A344310. %K A343321 nonn %O A343321 0,8 %A A343321 _Fausto A. C. Cariboni_, May 14 2021