OFFSET
1,2
COMMENTS
The sequence is multiplicative.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
Tanya Khovanova and Karan Sarkar, P-positions in modular extensions to Nim, International Journal of Game Theory, Vol. 46, No. 2 (2017), pp. 547-561, preprint, arXiv:1508.07054 [math.CO], 2015.
Mircea Merca, Euler’s partition function in terms of 2-adic valuation, Bol. Soc. Mat. Mex. 30, 76 (2024). See p. 11.
Mircea Merca, Overpartitions in terms of 2-adic valuation, Aequat. Math. (2024). See pp. 15-16.
FORMULA
a(n) = n, if n is odd.
a(2*n) = n + 2*a(n).
a(n) = n(nu(n)/2+1), where nu(n) is the 2-adic order of n.
From Werner Schulte, Feb 07 2018: (Start)
Multiplicative with a(2^e)=(e+2)*2^(e-1) and a(p^e)=p^e for p>2 and e>0.
Dirichlet g.f.: zeta(s-1)*(2^s-1)/(2^s-2).
Sum_{k=1..n} a(k) ~ 3*n^2/4. - Vaclav Kotesovec, Sep 10 2020
EXAMPLE
The P-positions for 2-modular Nim with 2 piles are: (0,0), (1,2), (2,1). Thus a(2) = 3.
MATHEMATICA
Table[n (IntegerExponent[n, 2]/2 + 1), {n, 100}]
PROG
(PARI) a(n) = n*(valuation(n, 2)/2 + 1); \\ Michel Marcus, Jan 13 2016
CROSSREFS
KEYWORD
nonn,mult,easy
AUTHOR
Tanya Khovanova and Karan Sarkar, Jan 10 2016
STATUS
approved