This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066484 Consists of at least 2 distinct digits (repetition of digits allowed but zeros not allowed), all of whose "rotations" (including the number itself) are exact multiples of its distinct digits. 4
 1113, 1131, 1311, 2226, 2262, 2622, 3111, 3339, 3393, 3933, 6222, 9333, 11133, 11313, 11331, 13113, 13131, 13311, 22266, 22626, 22662, 26226, 26262, 26622, 31113, 31131, 31311, 33111, 33399, 33939, 33993, 39339, 39393, 39933, 62226, 62262, 62622, 66222, 93339, 93393, 93933, 99333, 111333, 111339, 111393 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS "Rotation" of a (multi-digit) number involves taking the first digit of the number and putting it at the end to form a new number. For example, successive rotations of 1234 yield the numbers 2341, 3412 and 4123 (another rotation would give you back the original number). Subsequence of A034838, A052382 and of A139819. - Reinhard Zumkeller, Nov 29 2012 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..1000 Ken Duisenberg, Puzzle of the Week (Dec 14, 2001), Dividing Rotated Numbers EXAMPLE The rotations of 137179 are 371791, 717913, 179137, 791371, 913717, 137179; all these are divisible by 1,3,7,9. MATHEMATICA ddQ[n_]:=Module[{idn=IntegerDigits[n]}, DigitCount[n, 10, 0]==0 && Length[Union[idn]]>1 && And@@Flatten[Divisible[#, Union[idn]]&/@ (FromDigits/@Table[RotateRight[idn, i], {i, Length[idn]}])]]; Select[Range[10, 200000], ddQ]  (* Harvey P. Dale, Mar 30 2011 *) PROG (Haskell) -- import Data.List (nub, inits, tails) a066484 n = a066484_list !! (n-1) a066484_list = filter h [1..] where    h x = notElem '0' xs && length (nub xs) > 1 &&          all d (map read \$ zipWith (++)                (tail \$ tails xs) (tail \$ inits xs)) where xs = show x    d u = g u where          g v = v == 0 || mod u d == 0 && g v' where (v', d) = divMod v 10 -- Reinhard Zumkeller, Nov 29 2012 CROSSREFS Sequence in context: A236050 A213979 A225351 * A199982 A151951 A190017 Adjacent sequences:  A066481 A066482 A066483 * A066485 A066486 A066487 KEYWORD base,nice,nonn AUTHOR Sudipta Das (juitech(AT)vsnl.net), Jan 02 2002 EXTENSIONS Corrected and extended by Harvey P. Dale, Mar 30 2011 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 December 10 23:33 EST 2018. Contains 318049 sequences. (Running on oeis4.)