Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070175
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A070175
%S A070175 1,2,4,6,8,12,16,24,30,32,48,60,64,96,120,128,192,210,240,256,384,420,
%T A070175 480,512,768,840,960,1024,1536,1680,1920,2048,2310,3072,3360,3840,4096,
%U A070175 4620,6144,6720,7680,8192,9240,12288,13440,15360,16384,18480,24576
%N A070175 The smallest representative of each (bigomega(n),omega(n)) pair.
%C A070175 Equivalently, products of a member of A000079 and a member of A002110. 
               [From Matthew Vandermast (ghodges14(AT)comcast.net), Nov 04 2008]
%e A070175 24 is a term because (bigomega(24),omega(24))=(4,2) and 24 is the smallest 
               n for which (bigomega(n),omega(n))=(4,2).
%o A070175 (PARI) c_max=65; b=vector(c_max); o=vector(c_max); n=1; v=[n]; c=1; first 
               term = 1 b[1] & o[1] are bigomega(1) & omega(1) - already initialized 
               to 0 above. c_max is the total number of terms sought (including 
               1). Code exits for-loop to try new n upon the first match of a previous 
               pair. until(c==c_max, n++; for(m=1,c, if(bigomega(n)==b[m] && omega(n)==o[m], 
               break, else, if last previous pair checked, save term, save new unique 
               pair if(m==c, v=concat(v,n); c++; b[c]=bigomega(n); o[c]=omega(n))))); 
               v
%Y A070175 Cf. A001222 (bigomega(n)), A001221 (omega(n)).
%Y A070175 Cf. A025487. [From Matthew Vandermast (ghodges14(AT)comcast.net), Nov 
               04 2008]
%Y A070175 Sequence in context: A058629 A095810 A025487 this_sequence A096850 A062847 
               A001013
%Y A070175 Adjacent sequences: A070172 A070173 A070174 this_sequence A070176 A070177 
               A070178
%K A070175 nonn
%O A070175 0,2
%A A070175 Rick L. Shepherd (rshepherd2(AT)hotmail.com), May 06 2002

    
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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research