login

Revision History for A279796

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Erroneous duplicate of A285022.
(history; published version)
#41 by N. J. A. Sloane at Sat Jan 09 10:20:01 EST 2021
STATUS

editing

approved

#40 by N. J. A. Sloane at Sat Jan 09 10:19:58 EST 2021
DATA

820, 1276, 1422, 1926, 2080, 2640, 3160, 3186, 3250, 4446, 4720, 4930, 5370, 6006, 6546, 7386, 7450, 7476, 9066, 9276, 10626, 10836, 13146, 13300, 15640, 15666, 16056, 16060, 16446, 17020, 17466, 17550, 17766, 18040, 18910, 19176, 19230, 19416, 20736, 21000, 21246, 21310, 21376, 21726

820, 1276, 1422, 1926, 2080, 2640, 3160, 3186, 3250, 4446, 4720, 4930, 5370, 6006

COMMENTS

Related to Euler phi function by ((2*Sum_{n=1..a(m)} phi(n))-1)/a(m)^2 <= 6/Pi^2.

It appears that a(n) mod 2 = 0, but this is not necessarily true. In fact we can only assure that if a(n) is odd, a(n)+1 will be in the sequence too. Proof: Presuming P(a(n)) > 0.5 for an odd a(n), by phi(a(n)+1) <= 0.5 for a(n)+1 being even, P(a(n)+1) will always be smaller than P(a(n)). So, odd appearances may occur in this sequence as well, where we only can state that if a(n) is odd, a(n)+1 will occur too. Moreover it seems that a(n) mod 10 = 0, 2, 6, but a(433) = 226528 is a counterexample to this conjecture.

a(1) = 820 is possibly the first occurrence. The average behavior of the probability density P(n) is given by 1/zeta(n,2), where zeta(n,2) is the finite expansion of Euler's zeta function, i.e., zeta(n,2) = Sum_{i=1..n} 1/i^2. So the average behavior is that P(n) tends to 1/zeta(2) = 6/Pi^2 from above. However, due to the irregular behavior of primality and composite numbers, P(n) behaves similarly, giving the first irregular occurrence satisfying P(n) < 6/Pi^2 at n = 820. On average, the occurrences have a density of something less than 0.0025, which would imply that we could expect the first occurrence near 400, but from the average behavior of the probability density P(n) it is about twice this value.

PROG

Python program#

import math

from fraction import gcd

pi = 2*math.acos(0)

error = 0.1

t = 1

x = 0

while x < 117500:

....x = x + 1

....y = 0

....while y < x:

........y = y + 1

........if gcd(x, y) == 1:

............t = t + 2

....error = t/x/x - 6/pi/pi

....if error < 0:

........print(x, t/x/x, error)

KEYWORD

nonn,dead,changed

dead

AUTHOR

A.H.M. Smeets, Dec 19 2016

STATUS

proposed

editing

#39 by Andrew Howroyd at Fri Jan 08 18:06:08 EST 2021
STATUS

editing

proposed

Discussion
Fri Jan 08
18:13
Andrew Howroyd: A280877 refs this sequence
#38 by Andrew Howroyd at Fri Jan 08 18:05:05 EST 2021
DATA

820, 1276, 1422, 1926, 2080, 2640, 3160, 3186, 3250, 4446, 4720, 4930, 5370, 6006, 6546, 7386, 7450, 7476, 9066, 9276, 10626, 10836, 13146, 13300, 15640, 15666, 16056, 16060, 16446, 17020, 17466, 17550, 17766, 18040, 18910, 19176, 19230, 19416, 20736, 21000, 21246, 21310, 21376, 21726

Discussion
Fri Jan 08
18:06
Andrew Howroyd: I've advised the author (since he has a couple of pending edits). He can inject a comment if he has an opinion / indicate what should be merged to A285022. Yes, the rule is that it is the sequence with correct terms that survives (& if both correct then the one that was created first). I've also restored the erroneous term - since we don't want this to show up on a search for correct terms.
#37 by Andrew Howroyd at Fri Jan 08 17:59:14 EST 2021
COMMENTS

The corrected version of this sequence is a duplicate of A285022. - Jens Kruse Andersen, Jan 08 2021

#36 by Andrew Howroyd at Fri Jan 08 17:57:45 EST 2021
NAME

Irregular occurrences of the probability density P(n) of coprime numbers k,m, satisfying 1 <= k <= a(n) and 1 <= m <= a(n), such that P(k) < 1/zeta(2) = 6/Pi^2.

Erroneous duplicate of A285022.

KEYWORD

nonn,dead,changed

EXTENSIONS

Program corrected and false term removed by Jens Kruse Andersen, Jan 08 2021

STATUS

proposed

editing

#35 by Jens Kruse Andersen at Fri Jan 08 16:32:10 EST 2021
STATUS

editing

proposed

Discussion
Fri Jan 08
17:04
Alois P. Heinz: I cannot see that the program was changed.  If a duplicate is detected it should be declared "dead".  Removing the link to a b-file does not remove the file.
17:38
Jens Kruse Andersen: x = 1 in the program gave the false term 1422 which is also in the b-file. I corrected it to x = 0. I don't know OEIS policy on duplicates. A285022 is newer but only by 4 months, it was correct from the start, has a larger correct b-file, good comments, references and links, and a correct far faster program. If its author searched OEIS first then he probably wouldn't have found A279796 due to the false term. I think A285022 deserves to be the surviving sequence. I don't need credit for correcting A279796.
#34 by Jens Kruse Andersen at Fri Jan 08 16:31:11 EST 2021
DATA

820, 1276, 1422, 1926, 2080, 2640, 3160, 3186, 3250, 4446, 4720, 4930, 5370, 6006, 6546, 7386, 7450, 7476, 9066, 9276, 10626, 10836, 13146, 13300, 15640, 15666, 16056, 16060, 16446, 17020, 17466, 17550, 17766, 18040, 18910, 19176, 19230, 19416, 20736, 21000, 21246, 21310, 21376, 21726

COMMENTS

The corrected version of this sequence is a duplicate of A285022. - Jens Kruse Andersen, Jan 08 2021

LINKS

A. H. M. Smeets, <a href="/A279796/b279796.txt">Table of n, a(n) for n = 1..228</a>

PROG

x = 10

EXTENSIONS

Program corrected and false term removed by Jens Kruse Andersen, Jan 08 2021

STATUS

approved

editing

#33 by Susanna Cuyler at Thu Feb 27 22:47:23 EST 2020
STATUS

proposed

approved

#32 by Jon E. Schoenfield at Thu Feb 27 20:54:07 EST 2020
STATUS

editing

proposed