Search: id:A025487
Results 1-1 of 1 results found.

%I A025487
%S A025487 1,2,4,6,8,12,16,24,30,32,36,48,60,64,72,96,120,128,144,180,192,210,216,
%T A025487 240,256,288,360,384,420,432,480,512,576,720,768,840,864,900,960,1024,
%U A025487 1080,1152,1260,1296,1440,1536,1680,1728,1800,1920,2048,2160,2304,2310
%N A025487 List giving least integer of each prime signature; also products of primorial 
               numbers A002110.
%C A025487 All numbers of the form 2^k1*3^k2*...*p_n^k_n, where k1 >= k2 >= ... 
               >= k_n, sorted.
%D A025487 The exponents k1, k2, ... can be read off Abramowitz and Stegun, Handbook, 
               p. 831, column labeled "pi".
%H A025487 Franklin T. Adams-Watters, <a href="b025487.txt">Table of n, a(n) for 
               n = 1..10001</a>
%H A025487 M. Abramowitz and I. A. Stegun, eds., <a href="http://www.nrbook.com/
               abramowitz_and_stegun/">Handbook of Mathematical Functions</a>, National 
               Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 
               [alternative scanned copy].
%e A025487 The first few terms are 1, 2, 2^2, 2*3, 2^3, 2^2*3, 2^4, 2^3*3, 2*3*5, 
               ...
%t A025487 PrimeExponents[n_] := Flatten[ Table[ # [[2]], {1}] & /@ FactorInteger[n]]; 
               lpe = {}; ln = {1}; Do[pe = Sort@PrimeExponents@n; If[ FreeQ[lpe, 
               pe], AppendTo[lpe, pe]; AppendTo[ln, n]], {n, 2350}]; ln (from Robert 
               G. Wilson v Aug 14 2004)
%Y A025487 Cf. A036035, A025488, A051282. Equals range of values taken by A046523.
%Y A025487 Cf. A055932, A036041, A061394, A124832.
%Y A025487 Sequence in context: A048951 A058629 A095810 this_sequence A070175 A096850 
               A062847
%Y A025487 Adjacent sequences: A025484 A025485 A025486 this_sequence A025488 A025489 
               A025490
%K A025487 nonn,easy,nice
%O A025487 1,2
%A A025487 David W. Wilson (davidwwilson(AT)comcast.net)
%E A025487 Offset corrected by Matt Vandermast, Oct 19 2008

Search completed in 0.003 seconds