A067032 Number of k's such that A067030(n) = k + reverse(k).

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 9, 9, 7, 1, 6, 5, 1, 4, 3, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 8, 9, 8

Offset

0,12

Links

T. D. Noe, Table of n, a(n) for n = 0..1000

Example

a(12) = 3 since A067030(12) = 33 and for k = 12, 21, 30 we have 33 = k + reverse(k).

Prog

(ARIBAS): function a067032(a, b: integer); var n, k, c, i, rev: integer; st, nst: string; begin for n := a to b do k := 0; c := 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 inc(c); end; inc(k); end; if c > 0 then write(c, ", "); end; end; end; a067032(0, 1000); .

Crossrefs

Cf. A033865, A067030, A067031, A067033, A067034.

Sequence in context: A068064 A152147 A333830 * A052500 A355632 A179933

Adjacent sequences: A067029 A067030 A067031 * A067033 A067034 A067035

Keyword

base,easy,nonn

Author

Klaus Brockhaus, Dec 29 2001

Status

approved