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 A091889 #12 Aug 01 2023 06:56:07
%S A091889 0,0,1,0,1,2,0,1,3,2,2,5,2,3,8,4,6,12,6,11,16,11,16,24,17,23,34,26,35,
%T A091889 50,35,50,67,55,72,93,76,99,126,112,135,171,150,186,229,210,249,304,
%U A091889 280,336,398,380,443,526,499,584,680,665,759,886,858,985,1136,1123
%N A091889 Number of partitions of n into sums of exactly two distinct powers of 2.
%H A091889 David A. Corneth, <a href="/A091889/b091889.txt">Table of n, a(n) for n = 1..10000</a>
%e A091889 a(9)=3: 9 = (2^3+2^0) = (2^2+2^1)+(2^1+2^0) = (2^1+2^0)+(2^1+2^0)+(2^1+2^0).
%t A091889 With[{max = 64}, m = Select[Range[max], DigitCount[#, 2, 1] == 2 &]; a[n_] := Length@ IntegerPartitions[n, n, m]; Array[a, max]] (* _Amiram Eldar_, Aug 01 2023 *)
%Y A091889 Cf. A018819, A018900, A091890, A000120, A000041, A091893, A091891.
%K A091889 nonn
%O A091889 1,6
%A A091889 _Reinhard Zumkeller_, Feb 10 2004