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 A091890 #10 Aug 01 2023 06:56:10
%S A091890 0,0,0,0,0,0,1,0,0,0,1,0,1,2,0,0,0,1,1,1,3,2,0,1,3,3,2,5,2,1,1,5,6,3,
%T A091890 9,5,4,5,10,9,8,13,8,10,8,16,17,15,22,18,18,20,25,28,27,34,31,32,33,
%U A091890 44,49,44,64,53,56,61,71,77,77,100,88,94,99,123,125,132,162,147,154
%N A091890 Number of partitions of n into sums of exactly three distinct powers of 2.
%H A091890 David A. Corneth, <a href="/A091890/b091890.txt">Table of n, a(n) for n = 1..10000</a>
%e A091890 a(14)=2: 14 = (2^3+2^2+2^1) = (2^2+2^1+2^0)+(2^2+2^1+2^0).
%t A091890 With[{max = 80}, m = Select[Range[max], DigitCount[#, 2, 1] == 3 &]; a[n_] := Length@ IntegerPartitions[n, n, m]; Array[a, max]] (* _Amiram Eldar_, Aug 01 2023 *)
%Y A091890 Cf. A014311, A018819, A091889, A000120, A000041, A091893, A091891.
%K A091890 nonn
%O A091890 1,14
%A A091890 _Reinhard Zumkeller_, Feb 10 2004