Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052008
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052008 a(n) = 'n with digits sorted in ascending order' + 'n with digits sorted in descending order'. +0
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; listen)
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.

CROSSREFS

Cf. A052009, A056964.

Adjacent sequences: A052005 A052006 A052007 this_sequence A052009 A052010 A052011

Sequence in context: A070196 A113603 A056964 this_sequence A117463 A095371 A055960

KEYWORD

nonn,base,nice

AUTHOR

Patrick De Geest (pdg(AT)worldofnumbers.com), Nov 15 1999.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research