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 A344625 #12 Jun 06 2021 05:10:09 %S A344625 0,0,0,0,0,0,0,0,0,1,1,2,3,4,6,7,11,12,1,10,7,11,10,17,12,18,16,12,15, %T A344625 19,13,25,20,17,22,29,6,25,20,22,20,28,16,31,21,14,23,33,15,24,22,25, %U A344625 28,30,8,31,20,22,22,36,16,34,26,14,23,26,22,33,25,24 %N A344625 Number of knapsack partitions of n with largest part 9. %C A344625 An integer partition is knapsack if every distinct submultiset has a different sum. %C A344625 I computed terms a(n) for n = 0..50000 and the subsequence a(128)-a(2647) of length 2520 is repeated continuously. %H A344625 Fausto A. C. Cariboni, <a href="/A344625/b344625.txt">Table of n, a(n) for n = 0..3000</a> %e A344625 The initial nonzero values count the following partitions: %e A344625 9: (9) %e A344625 10: (9,1) %e A344625 11: (9,1,1), (9,2) %e A344625 12: (9,1,1,1), (9,2,1), (9,3) %Y A344625 Cf. A108917, A275972, A326017, A326034, A342684, A343321, A344310, A344340, A344412. %K A344625 nonn %O A344625 0,12 %A A344625 _Fausto A. C. Cariboni_, May 25 2021