|
| |
|
|
A052008
|
|
a(n) = 'n with digits sorted in ascending order' + 'n with digits sorted in descending order'.
|
|
3
| |
|
|
0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, 22, 33, 44, 55, 66, 77, 88, 99, 110, 22, 33, 44, 55, 66, 77, 88, 99, 110, 121, 33, 44, 55, 66, 77, 88, 99, 110, 121, 132, 44, 55, 66, 77, 88, 99, 110, 121, 132, 143, 55, 66, 77, 88, 99, 110, 121, 132, 143, 154, 66, 77, 88, 99, 110, 121
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
LINKS
| Zak Seidov, a(n),n=0..1000
Nick Hobson, Python program for this sequence
|
|
|
EXAMPLE
| E.g. n = 19 -> 19 + 91 = 110.
|
|
|
MATHEMATICA
| f[n_]:=Module[{sidn=Sort[IntegerDigits[n]]}, FromDigits[sidn]+ FromDigits[ Reverse[sidn]]]; Array[f, 70, 0] (* From Harvey P. Dale, Nov 13 2011 *)
|
|
|
CROSSREFS
| Cf. A052009, A056964.
Sequence in context: A062028 A070196 A056964 * A117463 A095371 A055960
Adjacent sequences: A052005 A052006 A052007 * A052009 A052010 A052011
|
|
|
KEYWORD
| nonn,base,nice
|
|
|
AUTHOR
| Patrick De Geest (pdg(AT)worldofnumbers.com), Nov 15 1999.
|
| |
|
|
