A381902 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest unused positive number such that a(n) shares a factor with a(n-1), while the total number of prime factors, counted with multiplicity, of the form 4*k+1 and 4*k+3 for all terms a(1)..a(n) never differs by more than 1.
1, 2, 4, 6, 8, 10, 5, 15, 3, 12, 16, 20, 14, 26, 13, 39, 9, 30, 25, 35, 7, 28, 32, 34, 17, 51, 18, 40, 22, 50, 24, 38, 52, 44, 55, 60, 58, 29, 87, 21, 70, 64, 68, 46, 74, 37, 111, 33, 75, 45, 65, 78, 36, 80, 48, 82, 41, 123, 42, 91, 104, 56, 100, 62, 31
Offset: 1
Examples
a(5) = 8 as the total number of prime factors of the form 4*k+1 and 4*k+3 for the first four terms is 0 and 1 respectively, thus a(5) cannot contain a single prime factor of the form 4*k+3. This eliminates 3 as a candidate, leaving 8 as the smallest available number that has no such prime factors and shares a factor with a(4) = 6. This is the first term to differ from A064413. a(7) = 5 as the total number of prime factors of the form 4*k+1 and 4*k+3 for the first six terms is 1 and 1 respectively, thus a term can be chosen that contains a single odd prime factor, and 5 is the smallest unused term that shares a factor with a(6) = 10.
Links
- Scott R. Shannon, Table of n, a(n) for n = 1..10000
- Scott R. Shannon, Image of the first 100000 terms. The colors are graduated across the spectrum to show the total number of prime factors of each term, with red being one prime factor. The thin green line is a(n) = n.
- Wikipedia, Chebyshev's bias.
Comments