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 #17 Aug 30 2016 14:52:34
%S 1,1,2,2,2,8,8,4,12,18,8,8,4,12,32,8,4,24,12,16,128,64,32,16,96,144,
%T 32,64,12,256,16,16,16,384,128,48,6,48,64,128,8,64,32,64,384,144,16,
%U 128,12,144,768,64,32,2048,128,256,256,1536,32,64,128,48
%N Number of odd divisors of A101292(n).
%H R. C. Castillo, <a href="http://www.apjmr.com/wp-content/uploads/2015/10/APJMR-2015-3.4.2.15.pdf">On the Sum of Corresponding Factorials and Triangular Numbers: Runsums, Trapezoids and Politeness</a>, Asia Pacific Journal of Multidisciplinary Research, 3 (2015), 95-101.
%t Table[Count[Divisors[n! + Total@ Range@ n], d_ /; OddQ@ d], {n, 0, 54}] (* _Michael De Vlieger_, Aug 30 2016 *)
%Y Cf. A001277, A101292.
%K nonn
%O 0,3
%A _N. J. A. Sloane_, Aug 30 2016
%E More terms from _Michael De Vlieger_, Aug 30 2016
%E More terms from _Alois P. Heinz_, Aug 30 2016