A030108 -id:A030108 - cp's OEIS frontend

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.

5, 11, 47, 67

Offset: 1

Naohiro Nomoto, Mar 18 2004

			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.

Cf. A004086, A030101-A030108, A056960-A056963, A037183, A091974.

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.

Original entry on oeis.org

7, 19, 61, 193

Offset: 1

Naohiro Nomoto, Mar 18 2004

			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.

Cf. A004086, A030101-A030108, A056960-A056963, A037183, A091974.

A092368 a(0)=0, a(1)=1, a(2)=1. For n>2, let R_{k}(n) = the digit reversal of n in base k (R_{k}(n) is written in base 10). a(n) is the smallest value of R_{k}(n) arising if k=2,..,n-1.

Original entry on oeis.org

0, 1, 1, 3, 1, 5, 2, 5, 1, 1, 2, 7, 2, 7, 2, 3, 1, 10, 2, 9, 2, 3, 2, 13, 2, 1, 2, 1, 2, 11, 2, 11, 1, 3, 2, 5, 1, 13, 2, 3, 2, 13, 2, 13, 2, 3, 2, 23, 2, 1, 2, 3, 2, 17, 2, 5, 2, 3, 2, 31, 2, 16, 2, 3, 1, 5, 2, 17, 2, 3, 2, 17, 2, 17, 2, 3, 2, 7, 2, 19, 2, 1, 2, 38, 2, 5, 2, 3, 2, 19, 2, 7, 2, 3, 2, 5

Offset: 0

Naohiro Nomoto, Mar 19 2004

Cf. A004086, A030101-A030108, A056960-A056963.

cp's OEIS Frontend

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.

Views

Author

Keywords

Examples

Crossrefs

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.

Views

Author

Keywords

Examples

Crossrefs

A092368 a(0)=0, a(1)=1, a(2)=1. For n>2, let R_{k}(n) = the digit reversal of n in base k (R_{k}(n) is written in base 10). a(n) is the smallest value of R_{k}(n) arising if k=2,..,n-1.

Views

Author

Keywords

Crossrefs