Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133220
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133220 a(n) is the smallest number k such that k and n*k are anagrams. +0
1
1, 125874, 1035, 1782, 142857, 1386, 1359, 113967, 1089 (list; graph; listen)
OFFSET

1,2

EXAMPLE

3*1035 = 3105, and it is the smallest such number.

MATHEMATICA

Table[Select[Range[1000000], Sort[IntegerDigits[ # ]] == Sort[IntegerDigits[n# ]] &][[1]], {n, 9}]

CROSSREFS

Cf. A023086, A023087, A023088, A023089, A023090, A023091, A023092, A023093.

Adjacent sequences: A133217 A133218 A133219 this_sequence A133221 A133222 A133223

Sequence in context: A030639 A100406 A048936 this_sequence A023086 A066690 A114668

KEYWORD

base,fini,full,nonn

AUTHOR

Tanya Khovanova (tanyakh(AT)yahoo.com), Oct 11 2007

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research