A182687 a(n) = the smallest 1-digit number with exactly n divisors, a(n) = 0 if no such number exists.

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

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: A066684 A328784 A128124 * A141062 A131806 A004518

Adjacent sequences: A182684 A182685 A182686 * A182688 A182689 A182690

Keyword

nonn,base,less

Author

Jaroslav Krizek, Nov 27 2010

Status

approved