The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A175694 a(n) is the smallest number such that a(n)*n is an anagram of a(n)*5. 0
 142857, 5436, 36, 2826, 1, 9, 279, 252, 2439, 214857, 552, 3348, 27, 37, 207, 3573, 3, 3384, 27, 3564, 2439, 25371, 37, 2538, 34857, 2085, 2115, 31968, 21207, 2772, 2295, 2516, 24975, 237681, 2718, 212535, 21663, 21645, 2439, 227934, 2199, 219465, 2049768, 20478, 2178, 2002185, 208596, 2043792, 2031939 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) does not exist for n >= 50 because a(n)*n >= 10*(a(n)*5) has more digits than a(n)*5. - Robert Israel, Nov 03 2014 LINKS EXAMPLE a(6)=9 because 6*9 = 54, 5*9 = 45 and 54 is an anagram of 45. MAPLE f:= proc(n) local d, k, a5; for d from 0 to 10 do   for k from ceil(10^d/5) to floor(10^(d+1)/n) do      a5:= sort(convert(k*5, base, 10));     if sort(convert(k*n, base, 10)) = a5 then return k fi   od od end proc: seq(f(n), n=1..49); # Robert Israel, Nov 03 2014 MATHEMATICA f[n_] := Block[ {k = 1}, While[ Sort@ IntegerDigits[5 k] != Sort@ IntegerDigits[k*n], k++ ]; k]; Array[f, 45] (* Robert G. Wilson v, Aug 15 2010 *) CROSSREFS Sequence in context: A256630 A263037 A086999 * A023089 A166320 A101202 Adjacent sequences:  A175691 A175692 A175693 * A175695 A175696 A175697 KEYWORD base,nonn,fini,full AUTHOR Claudio Meller, Aug 09 2010 EXTENSIONS More terms from Robert G. Wilson v, Aug 15 2010 a(43) to a(49) from Robert Israel, Nov 03 2014 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.

Last modified May 10 04:58 EDT 2021. Contains 343748 sequences. (Running on oeis4.)