|
Search: id:A128857
|
|
|
| A128857 |
|
Least number m such that quotient m/n is obtained merely by shifting the leftmost digit 1 of m to the right end. |
|
+0
2
|
|
| 1, 105263157894736842, 1034482758620689655172413793, 102564, 102040816326530612244897959183673469387755, 1016949152542372881355932203389830508474576271186440677966
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
A generalization of A092697. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 14 2008
|
|
LINKS
|
A. V. Chupin, Table of n, a(n) for n=1..100
|
|
EXAMPLE
|
a(4)=102564 since this is the smallest number which is divided by 4 when the first digit 1 is made the last digit.
|
|
MATHEMATICA
|
Moving digits a: Give[a_, n_]:=Block[{d=Floor[Log[10, n]]+1, m=(10n-1)/GCD[10n-1, a]}, If[m?1, While[PowerMod[10, d, m]!=N, d++ ], d=1]; ((10^(d+1)-1) a n)/(10n-1)]
|
|
CROSSREFS
|
Minimal numbers for shifting any digit (not only 1) are in A097717.
Adjacent sequences: A128854 A128855 A128856 this_sequence A128858 A128859 A128860
Sequence in context: A104837 A008923 A097717 this_sequence A092697 A067818 A095433
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Anton V. Chupin (chupin(X)icmm.ru), Apr 12, 2007
|
|
|
Search completed in 0.002 seconds
|
