Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062003
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062003 Product of the k numbers formed by cyclically permuting digits of n (where k = number of digits of n). +0
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; listen)
OFFSET

0,3

EXAMPLE

a(14) = 14*41 = 574, a(100) = 100*010*001 = 1000, a(102) = 102*210*21 = 449820.

PROGRAM

(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 this_sequence A061147 A004884 A061497

Adjacent sequences: A062000 A062001 A062002 this_sequence A062004 A062005 A062006

KEYWORD

nonn,base,easy

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 30 2001

EXTENSIONS

Corrected and extended by Frank.Ellermann(AT)t-online.de and Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 03, 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 13 16:35 EST 2010. Contains 173425 sequences.


AT&T Labs Research