Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061234
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A061234
%S A061234 6,36,1296,46656,60466176,2176782336,2821109907456,101559956668416,
%T A061234 131621703842267136,6140942214464815497216,221073919720733357899776,
%U A061234 10314424798490535546171949056,13367494538843734067838845976576
%N A061234 Smallest number with p(n)^2 divisors where p(n) is n-th prime.
%F A061234 a(n)=Min{x|d(x)=A000005(x)=p(n)^2}=6^[p(n)-1] because x=2^[pp-1] > 2^[p-1]3^[p-1] 
               holds if p>1.
%e A061234 1296=2.2.2.2.3.3.3.3 is the smallest number with 25 divisors.
%Y A061234 A000005, A005179, A003680, A037992, A061283, A061286, A061148, A061149.
%Y A061234 Sequence in context: A077290 A082027 A069031 this_sequence A061584 A067213 
               A003351
%Y A061234 Adjacent sequences: A061231 A061232 A061233 this_sequence A061235 A061236 
               A061237
%K A061234 nonn
%O A061234 1,1
%A A061234 Labos E. (labos(AT)ana.sote.hu), Jun 01 2001

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research