A331183 Number of values of k, 1 <= k <= n, with A323898(k) = A323898(n).

1, 1, 1, 2, 1, 1, 1, 3, 2, 2, 1, 1, 1, 1, 1, 4, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 5, 1, 3, 1, 1, 1, 4, 2, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 6, 1, 1, 1, 3, 1, 1, 1, 1, 1, 5, 1, 4, 1, 1, 1, 2, 1, 6, 1, 1, 2, 3, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1

Offset: 1

Author

Antti Karttunen, Jan 12 2020

Keywords

• nonn

Comments

Ordinal transform of A323898, or equally, of the ordered pair [A000120(n), A083254(n)].

Links

• Antti Karttunen, Table of n, a(n) for n = 1..16384
• Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537
• Index entries for sequences related to binary expansion of n

Crossrefs

Cf. A000120, A083254, A323898.

Cf. also A331182, A331184.

Programs

PARI

up_to = 16384;
ordinal_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), pt); for(i=1, length(invec), if(mapisdefined(om,invec[i]), pt = mapget(om, invec[i]), pt = 0); outvec[i] = (1+pt); mapput(om,invec[i],(1+pt))); outvec; };
A083254(n) = (2*eulerphi(n)-n);
A323898aux(n) = [hammingweight(n), A083254(n)];
v331183 = ordinal_transform(vector(up_to,n,A323898aux(n)));
A331183(n) = v331183[n];