|
| |
|
|
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.
|
|
0
| | |
|
|
|
OFFSET
| 1,1
|
|
|
EXAMPLE
| 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.
|
|
|
CROSSREFS
| Cf. A004086, A030101-A030108, A056960-A056963, A037183, A091974.
Sequence in context: A155226 A179406 A165683 * A155338 A155401 A155384
Adjacent sequences: A092356 A092357 A092358 * A092360 A092361 A092362
|
|
|
KEYWORD
| more,nonn,base,bref
|
|
|
AUTHOR
| Naohiro Nomoto (pcmusume(AT)m11.alpha-net.ne.jp), Mar 18 2004
|
| |
|
|
