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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182687 a(n) = the smallest 1-digit number with exactly n divisors, a(n) = 0 if no such number exists. 1
1, 2, 4, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..40.

FORMULA

A000005(a(n)) = n for n <= 4.

4 = max n such that a(n) > 0, a(n) = 0 for n > 4.

CROSSREFS

Cf. A182688.

Sequence in context: A242915 A066684 A128124 * A141062 A131806 A004518

Adjacent sequences:  A182684 A182685 A182686 * A182688 A182689 A182690

KEYWORD

nonn,base,less

AUTHOR

Jaroslav Krizek, Nov 27 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 3 01:12 EST 2016. Contains 278694 sequences.