|
| |
|
|
A067034
|
|
Largest k such that A067030(n) = k + reverse(k).
|
|
10
| |
|
|
0, 1, 2, 3, 4, 5, 10, 6, 7, 8, 9, 20, 30, 40, 50, 60, 70, 80, 90, 100, 91, 110, 93, 120, 94, 95, 130, 96, 97, 140, 98, 99, 150, 200, 160, 210, 170, 220, 180, 230, 190, 240, 250, 300, 260, 310, 270, 320, 280, 330, 290, 340, 350, 400, 360, 410, 370, 420, 380, 430
(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) = 30 since A067030(12) = 33 and 30 is the largest k such that 33 = k + reverse(k).
|
|
|
PROG
| (ARIBAS): function a067034(a, b: integer); var n, k, m, i, rev: integer; st, nst: string; begin for n := a to b do k := 0; m := -1; 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 m := k; end; inc(k); end; if m >= 0 then write(m, ", "); end; end; end; a067034(0, 500); .
|
|
|
CROSSREFS
| Cf. A033865, A067031, A067031, A067032, A067033.
Sequence in context: A115895 A116017 A067033 * A039697 A072620 A072619
Adjacent sequences: A067031 A067032 A067033 * A067035 A067036 A067037
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Dec 29 2001
|
| |
|
|
