|
| |
|
|
A092358
|
|
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 x 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.
|
|
0
| | |
|
|
|
OFFSET
| 1,1
|
|
|
EXAMPLE
| a(2)=11 because there are two solutions: R_{3}(11) = 19 and R_{3}(19) = 11, R_{9}(11) = 19 and R_{9}(19) = 11.
|
|
|
CROSSREFS
| Cf. A004086, A030101-A030108, A056960-A056963, A037183, A091974.
Sequence in context: A129015 A141355 A097056 * A079029 A106953 A149503
Adjacent sequences: A092355 A092356 A092357 * A092359 A092360 A092361
|
|
|
KEYWORD
| more,nonn,base,bref
|
|
|
AUTHOR
| Naohiro Nomoto (pcmusume(AT)m11.alpha-net.ne.jp), Mar 18 2004
|
| |
|
|
