OFFSET
0,3
LINKS
Hsien-Kuei Hwang, S. Janson, T.-H. Tsai, Exact and asymptotic solutions of the recurrence f(n) = f(floor(n/2)) + f(ceiling(n/2)) + g(n): theory and applications, Preprint 2016.
Hsien-Kuei Hwang, S. Janson, T.-H. Tsai, Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications, ACM Transactions on Algorithms, 13:4 (2017), #47; DOI: 10.1145/3127585.
MAPLE
read("transforms") : A000788 := proc(n) add( wt(j), j=0..n) ; end: A163095 := proc(n) A000788(n)^2 ; end: seq(A163095(n), n=0..100) ; # R. J. Mathar, Feb 22 2010
MATHEMATICA
Accumulate@ DigitCount[Range[0, 44], 2, 1]^2 (* Michael De Vlieger, Jan 23 2019 *)
PROG
(Python)
def A163095(n): return sum(i.bit_count() for i in range(1, n+1))**2 # Chai Wah Wu, Mar 02 2023
CROSSREFS
KEYWORD
easy,nonn,base
AUTHOR
Omar E. Pol, Aug 06 2009
EXTENSIONS
Extended by R. J. Mathar, Feb 22 2010
STATUS
approved