|
%I #33 Nov 23 2022 15:09:06
%S 0,1,3,5,7,11,13,15,19,23,27,29,31,39,43,47,51,55,59,61,63,79,87,91,
%T 95,103,107,111,115,119,123,125,127,143,159,175,183,187,191,207,215,
%U 219,223,231,235,239,243,247,251,253,255,287,303,319,335,351,367,375,379,383,399
%N Numbers k having only one partition into parts which are a sum of exactly as many distinct powers of 2 as there are 1's in the binary representation of k.
%C All positive terms are odd. - _Alois P. Heinz_, Dec 12 2021
%C Conjecture: if the second leftmost bit in the binary expansion of n+1 equals 0, then n is a term if and only if A007814(n+1) >= 2^(f(n)-1) + f(n). Otherwise, n is a term if and only if A007814(n+1) >= 2^f(n). Here f(n) = A086784(n+1). - _Mikhail Kurkov_, Oct 03 2022
%H David A. Corneth, <a href="/A091892/b091892.txt">Table of n, a(n) for n = 1..2053</a> (first 375 terms from Andrew Howroyd, n = 376..764 from Alois P. Heinz)
%F A091891(a(n)) = 1.
%e From _David A. Corneth_, Oct 03 2022: (Start)
%e 11 is in the sequence as numbers with 3 bits and are <= 11 are 7, 11. The only partition of 11 into parts of size 7 and 11 are 11.
%e 9 is not in the sequence as numbers with 2 bits, like 9, are 3, 5, 6, 9. 9 can be partitioned as 3+3+3 = 3+6 = 9 into these parts. As these are 3 > 1 partitions, 9 is not here. (End)
%t etr[p_] := Module[{b}, b[n_] := b[n] = If[n == 0, 1, Sum[Sum[d*p[d], {d, Divisors[j]}] b[n - j], {j, 1, n}]/n]; b];
%t EulerT[v_List] := With[{q = etr[v[[#]]&]}, q /@ Range[Length[v]]];
%t okQ[k_] := If[k == 0, True, If[EvenQ[k], False, EulerT[Table[DigitCount[j, 2, 1] == DigitCount[k, 2, 1] // Boole, {j, 1, k}]][[k]] == 1]];
%t Reap[For[k = 0, k <= 1000, k++, If[okQ[k], Print[k]; Sow[k]]]][[2, 1]] (* _Jean-François Alcover_, Dec 17 2021 *)
%o (PARI) EulerT(v)={Vec(exp(x*Ser(dirmul(v,vector(#v,n,1/n))))-1, -#v)}
%o upto(n)={Set(concat(vector(logint(n,2)+1, k, my(u=vector(n,i,hammingweight(i)==k), v=EulerT(u)); select(i->u[i]&&v[i]==1, [1..n], 1))))} \\ _Andrew Howroyd_, Apr 20 2021
%Y Cf. A018819, A091889, A091890, A091891, A000120, A000041.
%K nonn
%O 1,3
%A _Reinhard Zumkeller_, Feb 10 2004
%E Terms a(40) and beyond from _Andrew Howroyd_, Apr 20 2021
%E a(1)=0 inserted by _Alois P. Heinz_, Dec 12 2021
|
