Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111371
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111371 A number n is included if at least one prime dividing n is equal to an exponent of the highest power of any prime dividing n. +0
1
4, 12, 18, 20, 24, 27, 28, 36, 44, 50, 52, 54, 60, 68, 72, 76, 84, 90, 92, 98, 100, 108, 116, 120, 124, 126, 132, 135, 140, 144, 148, 150, 156, 160, 164, 168, 172, 180, 188, 189, 196, 198, 200, 204, 212, 216, 220, 228, 234, 236, 242, 244, 252, 260, 264, 268, 270 (list; graph; listen)
OFFSET

1,1

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

50 = 2^1 * 5^2. 2 is both a prime dividing 50 and the exponent of the highest power of 5 dividing 50. So 50 is in the sequence.

MATHEMATICA

Select[Range[2, 300], Intersection @@ Transpose[FactorInteger[ # ]] != {} &] (*Chandler*)

fQ[n_] := Block[{fi = FactorInteger[n]}, Position[ First[ # ] & /@ fi, Max[ Last[ # ] & /@ fi]] != {}]; Select[ Range[2, 291], fQ[ # ] &] (* Robert G. Wilson v *)

CROSSREFS

Sequence in context: A045042 A134860 A047958 this_sequence A078514 A074285 A057311

Adjacent sequences: A111368 A111369 A111370 this_sequence A111372 A111373 A111374

KEYWORD

nonn

AUTHOR

Leroy Quet Nov 08 2005

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net) and Robert G. Wilson v (rgwv(at)rgwv.com), Nov 09 2005

page 1

Search completed in 0.002 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research