%I A088932
%S A088932 1,2,4,6,10,14,20,26,36,46,60,74,94,114,140,166,201,236,280,324,380,436,
%T A088932 504,572,656,740,840,940,1060,1180,1320,1460,1625,1790,1980,2170,2390,
               2610,
%U A088932 2860,3110,3396,3682,4004,4326,4690,5054,5460,5866,6321,6776,7280,7784
%N A088932 G.f.: 1/((1-x)^2*(1-x^2)*(1-x^4)*(1-x^8)).
%H A088932 N. J. A. Sloane and J. A. Sellers, <a href="http://arXiv.org/abs/math.CO/
               0312418">On non-squashing partitions</a>, Discrete Math., 294 (2005), 
               259-274.
%p A088932 f := proc(n,k) option remember; if k > n then RETURN(0); fi; if k= 0 
               then if n=0 then RETURN(1) else RETURN(0); fi; fi; if k = 1 then 
               RETURN(1); fi; if n mod 2 = 1 then RETURN(f(n-1,k)); fi; f(n-1,k)+f(n/
               2,k-1); end; # present sequence is f(2m,5)
%p A088932 GFF := k->x^(2^(k-2))/((1-x)*mul((1-x^(2^j)),j=0..k-2)); # present g.f. 
               is GFF(5)/x^8
%p A088932 a:= proc(n) local m, r; m := iquo (n, 8, 'r'); r:= r+1; [1, 2, 4, 6, 
               10, 14, 20, 26][r]+ (((8/3*m +(4*r +28)/3)*m +[0, 4, 9, 14, 20, 26, 
               33, 40][r] +43/3)*m +[22, 33, 50, 67, 93, 119, 154, 189][r]/3)*m 
               end: seq (a(n), n=0..60); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), 
               Apr 17 2009]
%Y A088932 See A000027, A002620, A008804, A088954, A000123 for similar sequences.
%Y A088932 Sequence in context: A115065 A008804 A001307 this_sequence A088954 A000123 
               A103257
%Y A088932 Adjacent sequences: A088929 A088930 A088931 this_sequence A088933 A088934 
               A088935
%K A088932 nonn
%O A088932 0,2
%A A088932 N. J. A. Sloane (njas(AT)research.att.com), Dec 02 2003