A329486 a(n) = 3*A006519(n)/2 + n/2 where A006519(n) is the highest power of 2 dividing n.

2, 4, 3, 8, 4, 6, 5, 16, 6, 8, 7, 12, 8, 10, 9, 32, 10, 12, 11, 16, 12, 14, 13, 24, 14, 16, 15, 20, 16, 18, 17, 64, 18, 20, 19, 24, 20, 22, 21, 32, 22, 24, 23, 28, 24, 26, 25, 48, 26, 28, 27, 32, 28, 30, 29, 40, 30, 32, 31, 36, 32, 34, 33, 128, 34, 36, 35, 40

Offset: 1

Author

Markus Rissanen, Nov 14 2019

Keywords

• nonn

Comments

A combination of sequences A006519 (highest power of 2 dividing n) and A003602 (Kimberling's paraphrases).

Links

• Michael De Vlieger, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A006519, A003602.

Programs

Mathematica

Array[3*2^(IntegerExponent[#, 2] - 1) + #/2 &, 68] (* Michael De Vlieger, Jul 10 2022 *)

PARI

a(n) = (3*2^valuation(n, 2) + n)/2; \\ Michel Marcus, Mar 03 2020

Python

def A329486(n): return (3*(n&-n)+n)>>1 # Chai Wah Wu, Jul 10 2022

Extensions

Edited and more terms from Michel Marcus, Mar 03 2020