|
| |
|
|
A067033
|
|
Smallest k such that A067030(n) = k + reverse(k).
|
|
9
| |
|
|
0, 1, 2, 3, 4, 5, 10, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 100, 19, 29, 39, 120, 49, 59, 130, 69, 79, 140, 89, 99, 150, 101, 160, 111, 170, 121, 180, 131, 190, 141, 151, 102, 161, 112, 171, 122, 181, 132, 191, 142, 152, 103, 162, 113, 172, 123, 182, 133, 192
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n = 0..1000
|
|
|
EXAMPLE
| a(12) = 12 since A067030(12) = 33 and 12 is the smallest k such that 33 = k + reverse(k).
|
|
|
PROG
| (ARIBAS): function a067033(a, b: integer); var n, k, i, rev: integer; st, nst: string; begin for n := a to b do k := 0; while k <= n do st := itoa(k); nst := ""; for i := 0 to length(st) - 1 do nst := concat(st[i], nst); end; rev := atoi(nst); if n = k + rev then write(k, ", ") k := n + 1; else inc(k); end; end; end; end; a067033(0, 500); .
|
|
|
CROSSREFS
| Cf. A033865, A067030, A067031, A067032, A067034.
Sequence in context: A092233 A115895 A116017 * A067034 A039697 A072620
Adjacent sequences: A067030 A067031 A067032 * A067034 A067035 A067036
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Dec 29 2001
|
| |
|
|
