A373350 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest unused positive number such that omega(a(n)) does not equal omega(a(n-1)) or omega(a(n-2)).
1, 2, 6, 30, 3, 10, 42, 4, 12, 60, 5, 14, 66, 7, 15, 70, 8, 18, 78, 9, 20, 84, 11, 21, 90, 13, 22, 102, 16, 24, 105, 17, 26, 110, 19, 28, 114, 23, 33, 120, 25, 34, 126, 27, 35, 130, 29, 36, 132, 31, 38, 138, 32, 39, 140, 37, 40, 150, 41, 44, 154, 43, 45, 156, 47, 46, 165, 49, 48, 168, 53, 50, 170, 59
Offset: 1
Keywords
Examples
a(4) = 30 as a(2) = 2 has one distinct prime factor and a(3) = 6 has two distinct prime factors, and 30 is the smallest unused number with three distinct prime factors.
Links
- Scott R. Shannon, Table of n, a(n) for n = 1..10000
- Scott R. Shannon, Image of the first 500 terms. In this and other images terms with one, two, three, or more than three distinct prime factors are shown in red, yellow, green, violet respectively. The white line is a(n) = n.
- Scott R. Shannon, Image of the first 50000 terms.
- Scott R. Shannon, Image of the first 400000 terms.
Comments