login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084392 For k not divisible by 10, let f(k) be the number obtained by moving the last digit of k to the front. Then a(n) is the smallest k > 0, made of nonzero digits, such that for all 1 <= i < n, i+1 divides f^i(k). 0
1, 2, 6, 21, 2145, 2145, 2685, 6225, 6885 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..9.

EXAMPLE

a(5) = 2145 because 2 divides 5214, 3 divides 4521, 4 divides 1452 and 5 divides 2145.

CROSSREFS

Sequence in context: A028936 A066932 A181754 * A156155 A263486 A182544

Adjacent sequences:  A084389 A084390 A084391 * A084393 A084394 A084395

KEYWORD

base,nonn,easy,fini,full

AUTHOR

Amarnath Murthy, May 31 2003

EXTENSIONS

Edited and extended by David Wasserman, Dec 20 2004

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 22 06:14 EDT 2019. Contains 322329 sequences. (Running on oeis4.)