The EKG Sequence
暂无分享,去创建一个
The EKC or electrocardiogram sequence is defined by a(1) = 1, a(2) = 2 and, for n ≥ 3, a(n) is the smallest natural number not already in the sequence with the property that gcd{a(n − 1),a(n)} > 1. In spite of its erratic local behavior, which when plotted resembles an electrocardiogram, its global behavior appears quite regular. We conjecture that almost all a(n) satisfy the asymptotic formula a(n) = n(1+1/(3logn)) + o(n/log n) as n → ∞ and that the exceptional values a(n) = p and a(n) = 3p, for p a prime, produce the spikes in the EKG sequence. We prove that {a(n) : n ≥ 1) is a permutation of the natural numbers and that c 1 n ≤ a(n) ≤ c 2 n for constants c 1,c 2. There remains a large gap between what is conjectured and what is proved.
[1] Norbert Hegyvári,et al. Arithmetical properties of permutations of integers , 1983 .
[2] C. Hooley,et al. Applications of Sieve Methods to the Theory of Numbers , 1976 .
[3] V. Rich. Personal communication , 1989, Nature.
[4] Don Zagier,et al. The First 50 Million Prime Numbers , 1977 .
[5] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..