|
%I #49 Sep 26 2018 15:45:35
%S 1,0,-1,-1,-1,0,0,1,1,1,1,1,0,0,0,-1,-1,-1,-1,-1,-1,-1,0,0,0,0,1,1,1,
%T 1,1,1,1,1,1,0,0,0,0,0,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,0,0,0,0,0,0,1,
%U 1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1
%N a(n) = Sum_{k=0..n} A010815(k).
%C To construct the sequence: a(0)=1, a(1)=0, then (2*1+1) (-1)'s followed by 2 0's, followed by (2*2+1) 1's, followed by 3 0's, followed by (2*3+1) (-1)'s, etc.
%C From _George Beck_, May 05 2017: (Start)
%C a(n) = (Number of ones in the distinct partitions of n with an odd number of parts) - (number of ones in the distinct partitions of n with an even number of parts) (conjectured).
%C The partial sums give A246575. (End) [corrected by _Ilya Gutkovskiy_, Aug 18 2018]
%H Seiichi Manyama, <a href="/A078616/b078616.txt">Table of n, a(n) for n = 0..10000</a>
%H Mircea Merca, <a href="https://www.researchgate.net/publication/322245883_Higher-order_differences_and_higher-order_partial_sums_of_Euler%27s_partition_function">Higher-order differences and higher-order partial sums of Euler's partition function</a>, 2018.
%F For m > 0, a(k)=0 if A000326(m) <= k < A000326(m) + m; a(k)=(-1)^m if A000326(m) + m <= k < A000326(m+1).
%F G.f.: eta(x)/(1-x). - _Benoit Cloitre_, Jan 31 2004
%F G.f.: exp(-Sum_{k>=1} (sigma_1(k) - 1)*x^k/k). - _Ilya Gutkovskiy_, Aug 18 2018
%o (PARI) a(n)=polcoeff(eta(x)/(1-x)+O(x^n),n)
%Y Cf. A010815, A000326, A246575.
%K sign
%O 0,1
%A _Benoit Cloitre_, Dec 10 2002
|
