totient valence function
Given an integer , count how many integers in the set satisfy . This is the totient valence of , usually labelled . (The only two special cases are 2 and 6, for which one has to look a little beyound ).
Robert Carmichael conjectured that never. Two sequences in Sloane’s OEIS that list numbers with higher totient valences than preceding numbers are A007374 and A097942.