login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133220 a(n) is the smallest positive number k such that k and n*k are anagrams. 0
1, 125874, 1035, 1782, 142857, 1386, 1359, 113967, 1089 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..9.

EXAMPLE

3*1035 = 3105 and this 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.

Sequence in context: A224583 A252208 A175691 * A023086 A230722 A251016

Adjacent sequences:  A133217 A133218 A133219 * A133221 A133222 A133223

KEYWORD

base,fini,full,nonn

AUTHOR

Tanya Khovanova, Oct 11 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 07:31 EST 2019. Contains 329948 sequences. (Running on oeis4.)