[go: up one dir, main page]

login
Revision History for A134320 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Positive integers with more non-isolated divisors than isolated divisors.
(history; published version)
#11 by Charles R Greathouse IV at Wed Apr 09 10:16:32 EDT 2014
AUTHOR

Leroy Quet , Oct 20 2007

Discussion
Wed Apr 09
10:16
OEIS Server: https://oeis.org/edit/global/2154
#10 by N. J. A. Sloane at Wed Feb 05 20:18:43 EST 2014
AUTHOR

_Leroy Quet _ Oct 20 2007

Discussion
Wed Feb 05
20:18
OEIS Server: https://oeis.org/edit/global/2118
#9 by Russ Cox at Fri Mar 30 17:28:13 EDT 2012
COMMENTS

Comments from _Hugo van der Sanden (hv(AT)crypt.org), _, Oct 30 2007 and Oct 31 2007: (Start) A quick program to check found no other example up to 3e6, which certainly suggests it is not just finite but complete.

Discussion
Fri Mar 30
17:28
OEIS Server: https://oeis.org/edit/global/146
#8 by R. J. Mathar at Mon Jan 24 08:47:03 EST 2011
STATUS

reviewed

approved

#7 by Joerg Arndt at Mon Jan 24 07:24:04 EST 2011
STATUS

proposed

reviewed

#6 by Jason Kimberley at Mon Jan 24 06:59:44 EST 2011
COMMENTS

Since the divisors are symmetrically disposed around the square root, we have: if n is non-square, nonsquare, to be in this sequence it must be an oblong number, with all divisors below the square root non-isolated; if n is square, say n = m^2, then we have n divisible by m^2(m-1), so we require m-1 = 1.

STATUS

approved

proposed

#5 by N. J. A. Sloane at Sat Oct 02 03:00:00 EDT 2010
LINKS

Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> (listed in lieu of email address)

KEYWORD

nonn,new

nonn

#4 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009
EXAMPLE

The divisors of 42 are 1,2,3,6,7,14,21,42. Of these, 1,2,3,6,7 are non-isolated divisors, and 14,21,42 are isolated divisors. There are more non-isolated divisors (5 in number) than isolated divisors (3 in number), so 42 is in the sequence.

KEYWORD

nonn,new

nonn

#3 by N. J. A. Sloane at Fri Jan 09 03:00:00 EST 2009
LINKS

Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> (listed in lieu of email address)

KEYWORD

nonn,new

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Oct 20 2007

#2 by N. J. A. Sloane at Sun Dec 09 03:00:00 EST 2007
COMMENTS

Comments from Hugo van der Sanden (hv(AT)crypt.org), Oct 30 2007 and Oct 31 2007: (Start) A quick program to check found no other example up to 3e6, which certainly suggests it is not just finite but complete.

Partial proof: if adjacent integers k, k+1 both divide n then since they are coprime we also have that k(k+1) divides n, so k < sqrt(n).

I.e. the largest non-isolated factor a number can have is ceiling(sqrt(n)).

Since the divisors are symmetrically disposed around the square root, we have: if n is non-square, to be in this sequence it must be an oblong number, with all divisors below the square root non-isolated; if n is square, say n = m^2, then we have n divisible by m^2(m-1), so we require m-1 = 1.

So the only square entry is n = 4.

It remains to prove that there is no oblong number greater than 9*10 that avoids isolated divisors below the square root. (End)

KEYWORD

more,nonn,new

nonn