|
| |
|
|
A072432
|
|
Numbers n for which there are exactly eight k such that n = k + reverse(k).
|
|
0
| |
|
|
88, 808, 828, 848, 868, 888, 908, 928, 948, 968, 988, 1131, 1151, 1171, 1191, 1211, 1231, 1251, 1271, 1291, 1771, 2211, 2332, 3652, 4114, 5874, 8008, 9988, 12991, 15125, 16885, 17071, 17271, 17347, 17471, 17671, 17871, 18071, 18271, 18471
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Subsequence of A067030. First term is A072041(8).
|
|
|
LINKS
| Index entries for sequences related to Reverse and Add!
|
|
|
EXAMPLE
| 88 = k + reverse(k) for k = 17, 26, 35, 44, 53, 62, 71, 80.
|
|
|
MATHEMATICA
| krk8Q[n_]:=Count[Range[n-1], _?(#+FromDigits[Reverse[ IntegerDigits[#]]] ==n&)]==8; Select[Range[20000], krk8Q] (* From Harvey P. Dale, Apr 02 2011 *)
|
|
|
PROG
| (ARIBAS) var n, k, c, i, rev: integer; st, nst: string; end; m := 8; for n := 0 to 18800 do k := n div 2; c := 0; while k <= n and c < m + 1 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); if k mod 10 <> 0 and k <> rev then inc(c); end; end; inc(k); end; if c = m then write(n, ", "); end; end;
|
|
|
CROSSREFS
| Cf. A067030, A072041.
Sequence in context: A183839 A137124 A194651 * A136951 A136933 A136958
Adjacent sequences: A072429 A072430 A072431 * A072433 A072434 A072435
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 17 2002
|
| |
|
|
