The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60, we have over 367,000 sequences, and we’ve crossed 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A062003 Product of the k numbers formed by cyclically permuting digits of n (where k = number of digits of n). 3
 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 252, 403, 574, 765, 976, 1207, 1458, 1729, 40, 252, 22, 736, 1008, 1300, 1612, 1944, 2296, 2668, 90, 403, 736, 33, 1462, 1855, 2268, 2701, 3154, 3627, 160, 574, 1008, 1462, 44, 2430, 2944, 3478, 4032, 4606, 250 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Table of n, a(n) for n=0..50. EXAMPLE a(14) = 14*41 = 574, a(100) = 100*010*001 = 1000, a(102) = 102*210*21 = 449820. PROG (ARIBAS): for k := 0 to 60 do st := itoa(k); m := 1; for i := 1 to length(st) do st := concat(st[1..length(st)-1], st[0]); m := m*atoi(st); end; write(m, " "); end; CROSSREFS Cf. A061147. Sequence in context: A043316 A044913 A074156 * A061147 A004884 A061497 Adjacent sequences: A062000 A062001 A062002 * A062004 A062005 A062006 KEYWORD nonn,base,easy AUTHOR Amarnath Murthy, May 30 2001 EXTENSIONS Corrected and extended by Frank Ellermann and Klaus Brockhaus, Jun 03 2001 STATUS approved

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

Last modified December 2 11:04 EST 2023. Contains 367517 sequences. (Running on oeis4.)