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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182689 a(n) = the smallest 2-digit number with exactly n divisors, a(n) = 0 if no such number exists. 1

%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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 17 19:02 EDT 2024. Contains 375227 sequences. (Running on oeis4.)