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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083116 Smallest multiple of n using a single digit with multiplicity, or 0 if no such number exists. 2
1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 11, 444, 111111, 222222, 555, 0, 1111111111111111, 666, 111111111111111111, 0, 111111, 22, 1111111111111111111111, 888, 0, 222222, 999 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

1. If p is a prime > 5 then there exists a d such that a(p) = concatenation of '1' d times where p = k*d + 1 for some k. a(p)= (10^d -1)/9 < ={10^(p-1)- 1}/9. 2. a(n) = 0 if n = 10k, 16k or 25k.

REFERENCES

Amarnath Murthy, " On the divisors of the Smarandache Unary sequence" Smarandache Notions Journal, Volume 11, 1-2-3, Spring 2000.

CROSSREFS

Cf. A083117, A083118.

Sequence in context: A062567 A069554 A020485 * A084044 A048379 A169930

Adjacent sequences:  A083113 A083114 A083115 * A083117 A083118 A083119

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), Apr 23 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 16:00 EST 2012. Contains 206050 sequences.