%I #11 May 07 2024 20:13:01
%S 63,84,191,212,255,276,297,340,703,724,767,788,809,852,937,1022,1023,
%T 1044,1065,1108,1129,1150,1193,1278,1363,1364,2751,2772,2815,2836,
%U 2857,2900,2985,3070,3071,3092,3113,3156,3177,3198,3241,3326,3411,3412,3497,3582,3667,3752,3753,3838,3923,4008,4093,4094,4095
%N Numbers k such that A130249(k) differs from A372556(k).
%H Antti Karttunen, <a href="/A372558/b372558.txt">Table of n, a(n) for n = 1..24118</a>
%e From the terms of A372557 both 63 and 84 are included here, because the largest summand in their non-greedy solutions is different from the largest summand in their greedy solutions, while 169 is NOT included because the largest summand in both cases is 85. See examples in A372557.
%o (PARI)
%o A130249(n) = (#binary(3*n+1)-1);
%o isA372558(k) = (A372556(k)!=A130249(k)); \\ Uses also the program from A372556.
%Y Cf. A001045, A130249, A372555, A372556.
%Y Subsequence of A372557.
%K nonn
%O 1,1
%A _Antti Karttunen_, May 07 2024