|
| |
|
|
A067032
|
|
Number of k's such that A067030(n) = k + reverse(k).
|
|
14
| |
|
|
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
(list; graph; refs; listen; history; internal format)
|
|
|
|
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: A113009 A068064 A152147 * A052500 A179933 A047813
Adjacent sequences: A067029 A067030 A067031 * A067033 A067034 A067035
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Dec 29 2001
|
| |
|
|
