|
%I #21 Oct 21 2019 02:12:02
%S 0,0,0,2,2,4,6,10,10,12,14,18,20,24,28,34,34,36,38,42,44,48,52,58,60,
%T 64,68,74,78,84,90,98,98,100,102,106,108,112,116,122,124,128,132,138,
%U 142,148,154,162,164,168,172,178,182,188,194,202,206,212,218,226,232
%N a(n) = 2*n^2 - A077071(n).
%H Hsien-Kuei Hwang, Svante Janson, and Tsung-Hsi Tsai, <a href="http://140.109.74.92/hk/wp-content/files/2016/12/aat-hhrr-1.pdf">Exact and asymptotic solutions of the recurrence f(n) = f(floor(n/2)) + f(ceiling(n/2)) + g(n): theory and applications</a>, preprint, 2016.
%H Hsien-Kuei Hwang, Svante Janson, Tsung-Hsi Tsai, <a href="http://doi.org/10.1145/3127585">Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications</a>, ACM Transactions on Algorithms 13:4 (2017), #47.
%H Ralf Stephan, <a href="/somedcgf.html">Some divide-and-conquer sequences with (relatively) simple generating functions</a>, 2004.
%H Ralf Stephan, <a href="/A079944/a079944.ps">Table of generating functions (ps file)</a>.
%H Ralf Stephan, <a href="/A067699/a067699.pdf">Table of generating functions (pdf file)</a>.
%o (PARI) a(n)=2*n^2-sum(k=0,n,-valuation(polcoeff(pollegendre(2*n),2*k),2))
%Y Equals 2 * A078903(n).
%Y Cf. A067699, A077070, A077071.
%K nonn
%O 0,4
%A _Benoit Cloitre_, Nov 01 2002
|
