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 A342684 #11 Jun 06 2021 02:52:49 %S A342684 0,0,0,0,0,0,0,0,1,1,2,3,4,6,7,11,1,8,6,10,7,13,9,15,6,12,10,15,8,18, %T A342684 10,17,6,17,12,17,9,18,13,22,7,19,10,19,13,20,14,24,4,20,12,19,13,23, %U A342684 15,21,4,20,13,23,11,23,15,20,7,20,12,22,15,24,12,22 %N A342684 Number of knapsack partitions of n with largest part 8. %C A342684 An integer partition is knapsack if every distinct submultiset has a different sum. %C A342684 I computed terms a(n) for n = 0..40000 and the subsequence a(98)-a(937) of length 840 is repeated continuously. %H A342684 Fausto A. C. Cariboni, <a href="/A342684/b342684.txt">Table of n, a(n) for n = 0..1000</a> %e A342684 The initial nonzero values count the following partitions: %e A342684 8: (8) %e A342684 9: (8,1) %e A342684 10: (8,1,1), (8,2) %e A342684 11: (8,1,1,1), (8,2,1), (8,3) %Y A342684 Cf. A108917, A275972, A326034, A343321, A344310, A344340, A344412. %K A342684 nonn %O A342684 0,11 %A A342684 _Fausto A. C. Cariboni_, May 18 2021