|
Search: id:A067030
|
|
|
| A067030 |
|
Numbers n of the form k + reverse(k) for at least one k. |
|
+0
37
|
|
| 0, 2, 4, 6, 8, 10, 11, 12, 14, 16, 18, 22, 33, 44, 55, 66, 77, 88, 99, 101, 110, 121, 132, 141, 143, 154, 161, 165, 176, 181, 187, 198, 201, 202, 221, 222, 241, 242, 261, 262, 281, 282, 302, 303, 322, 323, 342, 343, 362, 363, 382, 383, 403, 404, 423, 424, 443
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Index entries for sequences related to Reverse and Add!
|
|
FORMULA
|
Contribution from Avik Roy (avik_3.1416(AT)yahoo.co.in), Feb 02 2009: (Start)
Any (k+1) digit number N can be represented as,
N=sum_{i=0...k} (ai*10^i)
Rev(N)=sum_{i=0...k} [ai*10^(k-i)]
N+Rev(N)=sum_{i=0...k} [ai*(10^i+10^(k-i))]
The latter formula can produce all the terms of this sequence, the order of terms is explicitly determined by the order of ai's [repeatation of terms might not be avoided] (End)
|
|
EXAMPLE
|
0 belongs to the sequence since 0 + 0 = 0; 33 belongs to the sequence since 12 + 21 = 33.
|
|
PROGRAM
|
(ARIBAS): function a067030(a, b: integer); var k, n, 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(n, ", "); k := n + 1; else inc(k); end; end; end; end; a067030(0, 500); .
|
|
CROSSREFS
|
Cf. A033865, A067031, A067032, A067033, A067034.
Sequence in context: A097660 A154809 A153170 this_sequence A072427 A050420 A096922
Adjacent sequences: A067027 A067028 A067029 this_sequence A067031 A067032 A067033
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Dec 29 2001
|
|
|
Search completed in 0.002 seconds
|
