Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079847
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079847 Smallest multiple of n in which the string of digits of n occur after (n-1) Most significant digits. +0
1
1, 12, 123, 1004, 10005, 100026, 1000027, 10000008, 100000089, 10000000010, 100000000111, 1000000000212, 10000000000913, 100000000000614, 1000000000000215, 10000000000000016, 100000000000000517 (list; graph; listen)
OFFSET

1,2

FORMULA

For n>1, let n' = n/2^a/5^b be n with all factors of 2 and 5 removed. Then a(n) = (10^{n-2}+mod(-(10^{n-2},n')) * 10^(floor(log_10(n))+1) + n. (The mod function used here always returns a nonnegative result; e.g. mod(-2,7) = 5.) - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jul 27 2006

EXAMPLE

a(4) = 1004, 4 occus as the 4-th digit from the left. a(10) = 10000000010. ('10') occurs afetr 9 digits.

CROSSREFS

Sequence in context: A113574 A078189 A127422 this_sequence A113572 A037701 A037610

Adjacent sequences: A079844 A079845 A079846 this_sequence A079848 A079849 A079850

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 18 2003

EXTENSIONS

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Jul 04 2003

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 | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research