OFFSET
1,2
COMMENTS
To generate this sequence, start with a list of the positive integers. For each positive integer, calculate the sum of its prime factors (with multiplicity) and move each element that numbers of positions to the right in the sequence. This is a permutation of the positive integers. All prime numbers appear in increasing order.
LINKS
Albert ten Oever, Python program
EXAMPLE
Generation of the first five elements:
- Start with the natural numbers: 1, 2, 3, 4, 5.
- Prime factorization of those numbers: 1, 2, 3, 2*2, 5.
- Sum of prime factors: 0, 2, 3, 4, 5.
- Now move each element:
- Move 1 0 steps: 1, 2, 3, 4, 5.
- Move 2 2 steps: 1, 3, 4, 2, 5.
- Move 3 3 steps: 1, 4, 2, 5, 3.
- Move 4 4 steps: 1, 2, 5, 3, 6, 4 (needed to extend range to move 4)
- Move 5 5 steps: 1, 2, 3, 6, 4, 7, 8, 5 (needed to extend range to move 5)
- Because 6, 7, 8 and 9 are also moved to the right, the first 5 elements are: 1, 2, 3, 4, 5.
CROSSREFS
KEYWORD
nonn
AUTHOR
Albert ten Oever, Mar 20 2019
EXTENSIONS
Corrected sequence caused by an error in the Python code generating the sequence. Edited by Albert ten Oever, Mar 24 2019
STATUS
approved
