%I A061286
%S A061286 2,4,16,64,1024,4096,65536,262144,4194304,268435456,1073741824,
%T A061286 68719476736,1099511627776,4398046511104,70368744177664,
%U A061286 4503599627370496,288230376151711744,1152921504606846976
%N A061286 Smallest integer for which the number of divisors is the n-th prime.
%C A061286 Seems to be the same as "Even numbers with prime number of divisors" 
               - Jason Earls (zevi_35711(AT)yahoo.com), Jul 04 2001
%C A061286 Except for the first term, smallest number == 1 (mod prime(n)) having 
               n divisors (by Fermat's little theorem). - Amarnath Murthy and Meenakshi 
               Srikanth (amarnath_murthy(AT)yahoo.com), Jun 20 2003
%F A061286 a(n) = 2^[p(n)-1] = Min{k| A000005(k) = prime} = 2^A006093(n).
%o A061286 (PARI) forstep(n=2,100000000,2,x=numdiv(n); if(isprime(x),print(n)))
%Y A061286 Cf. A000040, A000005, A005179, A003680, A061283, A061286, A006093, A005097, 
               A006254.
%Y A061286 Sequence in context: A154001 A154004 A060656 this_sequence A019279 A061652 
               A162119
%Y A061286 Adjacent sequences: A061283 A061284 A061285 this_sequence A061287 A061288 
               A061289
%K A061286 nonn
%O A061286 1,1
%A A061286 Labos E. (labos(AT)ana.sote.hu), May 22 2001