Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023101
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023101 a(n) is least k such that k and 9k are anagrams in base n (written in base 10). +0
1
1089, 167580, 253638, 2499, 48893, 69034, 315, 6264, 2532609, 36, 14649, 12155, 819, 869, 16974, 39, 570375, 19773, 56322, 42, 1305, 43200, 2852, 59296, 1489686, 1649, 3465, 1809, 2791613, 152, 165165, 105, 5699, 6006, 322586, 256289, 4987125, 9108 (list; graph; listen)
OFFSET

10,1

CROSSREFS

Sequence in context: A023093 A001232 A039684 this_sequence A031621 A031744 A031531

Adjacent sequences: A023098 A023099 A023100 this_sequence A023102 A023103 A023104

KEYWORD

nonn,base

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research