|
Search: id:A084392
|
|
|
| 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
|
| |
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(5) = 2145 because 2 divides 5214, 3 divides 4521, 4 divides 1452, and 5 divides 2145.
|
|
CROSSREFS
|
Adjacent sequences: A084389 A084390 A084391 this_sequence A084393 A084394 A084395
Sequence in context: A110306 A028936 A066932 this_sequence A129534 A085286 A062085
|
|
KEYWORD
|
base,nonn,easy,fini,full
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 31 2003
|
|
EXTENSIONS
|
Edited and extended by David Wasserman (wasserma(AT)spawar.navy.mil), Dec 20 2004
|
|
|
Search completed in 0.002 seconds
|
