A366797 Number of odd divisors permuted by A163511: a(n) = A001227(A163511(n)).

1, 1, 1, 2, 1, 3, 2, 2, 1, 4, 3, 3, 2, 4, 2, 2, 1, 5, 4, 4, 3, 6, 3, 3, 2, 6, 4, 4, 2, 4, 2, 2, 1, 6, 5, 5, 4, 8, 4, 4, 3, 9, 6, 6, 3, 6, 3, 3, 2, 8, 6, 6, 4, 8, 4, 4, 2, 6, 4, 4, 2, 4, 2, 2, 1, 7, 6, 6, 5, 10, 5, 5, 4, 12, 8, 8, 4, 8, 4, 4, 3, 12, 9, 9, 6, 12, 6, 6, 3, 9, 6, 6, 3, 6, 3, 3, 2, 10, 8, 8, 6, 12, 6, 6

Offset: 0

Author

Antti Karttunen, Oct 27 2023

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 0..16384
• Index entries for sequences related to binary expansion of n

Crossrefs

Cf. A001227, A163511, A366798 (rgs-transform).

Cf. also A324186, A366873.

Programs

PARI

A001227(n) = numdiv(n>>valuation(n, 2));
A163511(n) = if(!n, 1, my(p=2, t=1); while(n>1, if(!(n%2), (t*=p), p=nextprime(1+p)); n >>= 1); (t*p));
A366797(n) = A001227(A163511(n));

Formula

a(n) = 2*A366873(n) - A324186(n).