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 A029909 #18 Jun 16 2025 19:32:29 %S A029909 0,4,5,5,5,7,7,5,5,5,5,5,7,13,5,7,5,5,11,7,7,5,19,7,7,7,5,11,7,5,11,7, %T A029909 11,5,7,5,17,11,5,13,13,31,7,5,13,7,5,5,7,5,5,7,5,13,23,5,5,13,7,43,5, %U A029909 13,11,7,17,13,5,5,19,5,5,13,5,17,5,13,19,5,5,13,5,11,5,5,11,5 %N A029909 Starting with n (but omitting the primes), repeatedly sum prime factors (counted with multiplicity) until reaching a limit. %C A029909 Is this sequence generating ALL prime numbers (greater than 3) ? Also how many times each prime (greater than 3)is generated in this sequence? - _Alexander R. Povolotsky_, Nov 05 2008 %C A029909 Records appear to correspond to A006512 (n>2). - _Bill McEachen_, Jun 10 2025 %H A029909 Paolo P. Lava, <a href="/A029909/b029909.txt">Table of n, a(n) for n = 1..10000</a> %e A029909 20 -> 2+2+5 = 9 -> 3+3 = 6 -> 2+3 = 5. %Y A029909 Cf. A029908. %K A029909 nonn %O A029909 1,2 %A A029909 _Dann Toliver_