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 A265743 #9 Dec 18 2015 11:26:26 %S A265743 0,1,2,1,1,2,3,1,1,2,1,1,2,3,2,1,1,2,1,1,2,3,1,1,2,1,1,2,3,2,2,1,1,2, %T A265743 1,1,2,3,1,1,2,1,1,2,3,2,1,1,2,1,1,2,3,1,1,2,1,1,2,3,2,2,3,1,1,2,1,1, %U A265743 2,3,1,1,2,1,1,2,3,2,1,1,2,1,1,2,3,1,1,2,1,1,2,3,2,2,1,1,2,1,1,2,3,1,1,2,1,1,2,3,2,1,1,2,1,1,2,3,1,1,2,1,1,2,3,2,2,3,4,1,1 %N A265743 a(n) = number of terms of A005187 needed to sum to n using the greedy algorithm. %C A265743 a(0) = 0, because no numbers are needed to form an empty sum, which is zero. %H A265743 Antti Karttunen, <a href="/A265743/b265743.txt">Table of n, a(n) for n = 0..8192</a> %F A265743 Other identities. For all n >= 1: %F A265743 a(A005187(n)) = 1 and a(A055938(n)) > 1. %Y A265743 Cf. A005187, A055938. %Y A265743 Cf. also A000120, A007895, A053610, A265404, A265744, A265745. %K A265743 nonn %O A265743 0,3 %A A265743 _Antti Karttunen_, Dec 17 2015