|
%I #6 Sep 08 2022 13:15:36
%S 1,1,1,1,1,1,4,9,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,
%T 65536,131072,262144,524288,1048576,2097152,4194304,8388608,16777216,
%U 33554432,67108864,134217728,268435456,536870912,1073741824,2147483648
%N Number of subsets of {1,2,3,...,n} that sum to 0 mod 16.
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (2).
%F a(n) = 2^(-4+n) for n>7. G.f.: (2*x^8 -x^7 -2*x^6 +x^5 +x^4 +x^3 +x^2 +x -1) / (2*x -1). - _Colin Barker_, Dec 22 2012
%Y 16th row of A068009.
%K nonn,easy
%O 0,7
%A _Antti Karttunen_, Feb 11 2002
|
