%I #4 May 26 2014 21:14:31

%S 1,2,6,4,10,26,46,50,36,22,110,52,88,14,140,16,34,32,76,44,168,106,

%T 146,104,100,38,522,196,64,130,3256,224,280,94,308,526,400,266,1026,

%U 250,386,86,298,212,438,466,674,208,1666,200,1236,304,424,202,550,728

%N Smallest m such that A242885(m) = n.

%C A242885(a(n)) = n and A242885(m) <> n for m < a(n);

%C n + a(n) is a divisor of n^n + a(n)^a(n).

%H Reinhard Zumkeller, <a href="/A242901/b242901.txt">Table of n, a(n) for n = 1..660</a>

%e n = 3: a(3) = 6, 3^3 + 6^6 = 46683 = (3+6) * 5187;

%e n = 4: a(4) = 4, 4^4 + 4^4 = 512 = (4+4) * 64;

%e n = 5: a(5) = 10, 5^5 + 10^10 = 10000003125 = (5+10) * 666666875;

%e n = 6: a(6) = 26, 6^6 + 26^26 = 6156119580207157310796674288400250432 = (6+26) * 192378736881473665962396071512507826.

%o (Haskell)

%o a242901 = (+ 1) . fromJust . (`elemIndex` a242885_list)

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, May 25 2014