The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A212666 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A212666

Numbers such that the greatest prime divisor is less than the product of the other distinct prime divisors.
(history; published version)

#7 by R. J. Mathar at Sun Sep 02 10:33:52 EDT 2018

STATUS

editing

approved

#6 by R. J. Mathar at Sun Sep 02 10:33:40 EDT 2018

LINKS

R. J. Mathar, <a href="/A212666/b212666.txt">Table of n, a(n) for n = 1..10000</a>

STATUS

approved

editing

#5 by T. D. Noe at Wed May 23 19:58:36 EDT 2012

STATUS

editing

approved

#4 by T. D. Noe at Wed May 23 19:58:33 EDT 2012

NAME

Numbers such that the greatest prime divisor is less than the product of the other prime distinct prime divisors.

MAPLE

x[i] ', 'i'=1..m): q:=p/x[m]:if x[m] < q then printf(`%d, `, n):else fi:od:

STATUS

proposed

editing

#3 by Michel Lagneau at Wed May 23 09:13:19 EDT 2012

STATUS

editing

proposed

#2 by Michel Lagneau at Wed May 23 09:13:03 EDT 2012

NAME

allocated for Michel LagneauNumbers such that the greatest prime divisor is less than the product of the other prime distinct divisors.

DATA

30, 60, 70, 90, 105, 120, 140, 150, 154, 165, 180, 182, 195, 210, 231, 240, 270, 273, 280, 286, 300, 308, 315, 330, 350, 357, 360, 364, 374, 385, 390, 399, 418, 420, 429, 442, 450, 455, 462, 480, 490, 494, 495, 510, 525, 540, 546, 560, 561, 570, 572, 585, 595

OFFSET

1,1

EXAMPLE

30 is in the sequence because 30 = 2*3*5 and 5 < 2 * 3 = 6.

MAPLE

with(numtheory):for n from 2 to 600 do:x:=factorset(n):m:=nops(x): p:=product( '

x[i] ', 'i'=1..m): q:=p/x[m]:if x[m] < q then printf(`%d, `, n):else fi:od:

KEYWORD

allocated

nonn

AUTHOR

Michel Lagneau, May 23 2012

STATUS

approved

editing

#1 by Michel Lagneau at Wed May 23 09:13:03 EDT 2012

NAME

allocated for Michel Lagneau

KEYWORD

allocated

STATUS

approved