Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Sep 08 2022 13:13:09
%S 1,1,1,1,1,1,1,1,1,1,1,2,21,105,316,705,1297,2181,3837,7596,15962,
%T 32998,66173,131379,261910,524012,1048568,2097228,4194318,8388600,
%U 16777216,33554434,67108864,134217728,268435456,536870912,1073741824
%N Number of subsets of {1,2,3,...,n} that sum to 0 mod 64.
%H Alois P. Heinz, <a href="/A068045/b068045.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (2).
%F G.f.: (4*x^32 -2*x^31 -16*x^30+36*x^29 +138*x^28 -92*x^27 -544*x^26 -192*x^25 +848*x^24 +967*x^23 -177*x^22 -1074*x^21 -770*x^20 +78*x^19 +525*x^18 +413*x^17 +113*x^16 -73*x^15 -106*x^14 -63*x^13 -17*x^12 +x^10 +x^9 +x^8 +x^7 +x^6 +x^5 +x^4 +x^3 +x^2 +x-1) / (2*x-1). - _Alois P. Heinz_, Jan 18 2014
%Y 64th row of A068009.
%K nonn,easy
%O 0,12
%A _Antti Karttunen_, Feb 11 2002