A092359 - cp's OEIS frontend

A092359 Let R_{k}(m) = the digit reversal of m in base k (R_{k}(m) is written in base 10). a(n) is the smallest y such that there are exactly n bases {k} (k >= 2 and (x < y)) solutions of the equation: R_{k}(x) = y and R_{k}(y) = x.

%I A092359 #7 Nov 05 2013 02:32:34
%S A092359 7,19,61,193
%N A092359 Let R_{k}(m) = the digit reversal of m in base k (R_{k}(m) is written in base 10). a(n) is the smallest y such that there are exactly n bases {k} (k >= 2 and (x < y)) solutions of the equation: R_{k}(x) = y and R_{k}(y) = x.
%e A092359 a(2)=19 because there are two solutions: R_{3}(11) = 19 and R_{3}(19) = 11, R_{9}(11) = 19 and R_{9}(19) = 11.
%Y A092359 Cf. A004086, A030101-A030108, A056960-A056963, A037183, A091974.
%K A092359 more,nonn,base
%O A092359 1,1
%A A092359 _Naohiro Nomoto_, Mar 18 2004

cp's OEIS Frontend

A092359 Let R_{k}(m) = the digit reversal of m in base k (R_{k}(m) is written in base 10). a(n) is the smallest y such that there are exactly n bases {k} (k >= 2 and (x < y)) solutions of the equation: R_{k}(x) = y and R_{k}(y) = x.