login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A331182
Number of values of k, 1 <= k <= n, with A083254(k) = A083254(n), where A083254(n) = 2*phi(n) - n.
3
1, 1, 2, 2, 1, 1, 1, 3, 2, 2, 1, 1, 1, 3, 3, 4, 1, 1, 1, 2, 3, 4, 1, 1, 2, 5, 2, 3, 1, 1, 1, 5, 1, 6, 1, 1, 1, 7, 3, 2, 1, 1, 1, 4, 4, 8, 1, 1, 2, 1, 2, 5, 1, 2, 1, 3, 3, 9, 1, 1, 1, 10, 4, 6, 1, 1, 1, 6, 1, 1, 1, 1, 1, 11, 2, 7, 1, 1, 1, 2, 2, 12, 1, 1, 2, 13, 2, 4, 1, 1, 1, 8, 3, 14, 1, 1, 1, 2, 2, 1, 1, 1, 1, 5, 1
OFFSET
1,3
COMMENTS
Ordinal transform of A083254.
LINKS
MATHEMATICA
Module[{b}, b[_] = 0;
a[n_] := With[{t = 2 EulerPhi[n] - n}, b[t] = b[t] + 1]];
Array[a, 105] (* Jean-François Alcover, Jan 12 2022 *)
PROG
(PARI)
up_to = 65537;
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);
v331182 = ordinal_transform(vector(up_to, n, A083254(n)));
A331182(n) = v331182[n];
CROSSREFS
Cf. also A081373, A331175, A331181.
Sequence in context: A086275 A066855 A175685 * A182591 A321393 A058914
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 11 2020
STATUS
approved