|
Search: id:A092697
|
|
|
| A092697 |
|
Least n-parasitic number. |
|
+0
3
|
|
| 105263157894736842, 1034482758620689655172413793, 102564, 102040816326530612244897959183673469387755, 1016949152542372881355932203389830508474576271186440677966, 1014492753623188405797, 1012658227848, 10112359550561797752808988764044943820224719
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
A k-parasitic number (2<=k<=9) is one such that when it is multiplied by k, the product obtained is merely its rightmost digit transferred in front at the leftmost end.
|
|
REFERENCES
|
C. A. Pickover, Wonders of Numbers, Chapter 28, Oxford Univ. Press UK 2000.
|
|
LINKS
|
P. Yiu, k-left-transposable integersChap.18.2 pp. 168/360 in 'Recreational Mathematics'
|
|
FORMULA
|
a(n) = n(10^m-1)/(10n-1), where m (=A094224) is the order of 10 modulo 10n-1. - Moses Liskov (mliskov(AT)cs.wm.edu), May 17 2006
|
|
EXAMPLE
|
102564 is 4-parasitic because we have 102564*4=410256.
|
|
CROSSREFS
|
Cf. A094676.
Sequence in context: A008923 A097717 A128857 this_sequence A067818 A095433 A099727
Adjacent sequences: A092694 A092695 A092696 this_sequence A092698 A092699 A092700
|
|
KEYWORD
|
fini,full,base,nonn
|
|
AUTHOR
|
Lekraj Beedassy (blekraj(AT)yahoo.com), Aug 21 2004; corrected Dec 17 2004
|
|
|
Search completed in 0.002 seconds
|
