A062003 Product of the k numbers formed by cyclically permuting digits of n (where k = number of digits of n).

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

Offset

0,3

Comments

Apparently some kind of distinctness is required, because n=11 (cyclically permuted again 11) is not translated to 11*11=121. - R. J. Mathar, Jun 13 2025

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, A061378.

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