A182689 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A182689

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

%I #6 Mar 30 2012 19:00:24

%S 0,11,25,10,16,12,64,24,36,48,0,60,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,

%T 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0

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

%F A000005(a(n)) = n for a(n) > 0.

%F 12 = max n such that a(n) > 0, a(n) = 0 for n > 12.

%Y Cf. A182690.

%K nonn,base,less

%O 1,2

%A _Jaroslav Krizek_, Nov 27 2010