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 A344412 #14 Jun 06 2021 08:16:28 %S A344412 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 A344412 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 A344412 14,5,17,15,17,10,18,14,9,13,18,13,15,15,18,5,18,11 %N A344412 Number of knapsack partitions of n with largest part 7. %C A344412 An integer partition is knapsack if every distinct submultiset has a different sum. %C A344412 I computed terms a(n) for n = 0..25000 and the subsequence a(72)-a(491) of length 420 is repeated continuously. %H A344412 Fausto A. C. Cariboni, <a href="/A344412/b344412.txt">Table of n, a(n) for n = 0..1000</a> %e A344412 The initial nonzero values count the following partitions: %e A344412 7: (7) %e A344412 8: (7,1) %e A344412 9: (7,1,1), (7,2) %e A344412 10: (7,1,1,1), (7,2,1), (7,3) %Y A344412 Cf. A108917, A275972, A326017, A326034, A343321, A344310, A344340. %K A344412 nonn %O A344412 0,10 %A A344412 _Fausto A. C. Cariboni_, May 17 2021