Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080366
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A080366
%S A080366 4,8,9,16,25,27,32,36,49,64,72,81,100,108,121,125,128,144,169,196,200,
%T A080366 216,225,243,256,288,289,300,324,343,361,392,400,432,441,484,500,512,
%U A080366 529,576,588,600,625,648,675,676,729,784,800,841,864,900,961,968,972
%N A080366 n is such that neither of its least nor the largest prime divisors are 
               unitary prime divisors of n.
%e A080366 n=300: it is not a prime, 300=2.2.3.5.5; extremal prime factors are 2 
               and 5; GCD[2,90/2]=GCD[5,90/5]>1 so 2 and 5 are not unitary-prime-divisor 
               of 300, thus 300 is here.
%t A080366 ma[x_] := Part[Reverse[Flatten[FactorInteger[x]]], 2] mi[x_] := Part[Flatten[FactorInteger[x]], 
               1] k=0; Do[s=mi[n]; s1=ma[n]; If[ !Equal[GCD[s, n/s], 1]&&!Equal[GCD[s1, 
               n/s1], 1]&&!PrimeQ[n], Print[n]], {n, 2, 1000}]
%Y A080366 Cf. A034444, A056169, A020639, A006530, A080363, A080364, A080365.
%Y A080366 Sequence in context: A127398 A109422 A158804 this_sequence A001694 A157985 
               A001597
%Y A080366 Adjacent sequences: A080363 A080364 A080365 this_sequence A080367 A080368 
               A080369
%K A080366 nonn
%O A080366 1,1
%A A080366 Labos E. (labos(AT)ana.sote.hu), Feb 21 2003

    
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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research