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 A336433 #29 May 24 2021 00:08:44 %S A336433 0,0,0,1,5,68,403,7257,61686,1174434,13810620,335547727,3783688286, %T A336433 124486381056,1935430229612,55798127869680,1058567311736669, %U A336433 39819079382937334,717447490866241055,32064848897165970340,666062878027691348450,28916070816360797805534 %N A336433 Number of sequences of n numbers from 1 to n that do not have a subsequence that adds up to n. %C A336433 The sequence is bounded above for odd n by (((n-1)/2)^n)*(2^((n-1)/2)). %C A336433 Growth appears to be slightly faster than exponential, but irregular, with odd-numbered terms larger than the trend. %H A336433 Christopher L. Reedy, <a href="/A336433/b336433.txt">Table of n, a(n) for n = 1..30</a> %H A336433 Pierre Abbat, <a href="https://github.com/phma/fullproc">Fullproc</a> %H A336433 Christopher L. Reedy, <a href="https://github.com/chrisreedy/fun/tree/master/A336433">sequence.py</a> %e A336433 For n=3, the only solution is 2,2,2. %e A336433 For n=4, the 5 solutions are 3,3,3,3 and the four permutations of 3,3,3,2. %o A336433 (C++) See Fullproc link. %o A336433 (Python) # See sequence.py link. %Y A336433 Cf. A000312. %K A336433 nonn %O A336433 0,5 %A A336433 _Pierre Abbat_, Jul 21 2020 %E A336433 a(19)-a(21) from _Christopher L. Reedy_, Aug 06 2020