This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A307032 #24 Dec 11 2019 08:54:09 %S A307032 1,2,3,4,5,6,8,7,9,10,12,11,14,15,16,18,13,20,21,17,24,22,25,27,19,28, %T A307032 30,26,32,23,33,36,35,40,34,42,29,39,45,38,48,44,31,49,50,54,46,52,51, %U A307032 56,55,60,37,63,64,57,41,43,66,65,70,72,58,68,75,47,62 %N A307032 Permutation of the positive integers formed by moving each number the sum of its prime factors to the right. %C A307032 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. %H A307032 Albert ten Oever, <a href="https://bitbucket.org/agtoever/a307032">Python program</a> %e A307032 Generation of the first five elements: %e A307032 - Start with the natural numbers: 1, 2, 3, 4, 5. %e A307032 - Prime factorization of those numbers: 1, 2, 3, 2*2, 5. %e A307032 - Sum of prime factors: 0, 2, 3, 4, 5. %e A307032 - Now move each element: %e A307032 - Move 1 0 steps: 1, 2, 3, 4, 5. %e A307032 - Move 2 2 steps: 1, 3, 4, 2, 5. %e A307032 - Move 3 3 steps: 1, 4, 2, 5, 3. %e A307032 - Move 4 4 steps: 1, 2, 5, 3, 6, 4 (needed to extend range to move 4) %e A307032 - Move 5 5 steps: 1, 2, 3, 6, 4, 7, 8, 5 (needed to extend range to move 5) %e A307032 - Because 6, 7, 8 and 9 are also moved to the right, the first 5 elements are: 1, 2, 3, 4, 5. %Y A307032 Cf. A001414 (sum of primes dividing n, with repetition). %K A307032 nonn %O A307032 1,2 %A A307032 _Albert ten Oever_, Mar 20 2019 %E A307032 Corrected sequence caused by an error in the Python code generating the sequence. Edited by _Albert ten Oever_, Mar 24 2019