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 A096460 #17 Jun 26 2025 10:52:10 %S A096460 1,2,4,6,11,22,35,47,94,143,167,334,503,1006,1511,3022,4535,5447,5879, %T A096460 11758,17639,18239,18336,18532,18688,18763,19439,22223,22607,22704, %U A096460 22763,22896,22954,23478,23546,23802,27774,29322,29508,31972,39967 %N A096460 a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + sum of the unique prime factors of a(n). %H A096460 T. D. Noe, <a href="/A096460/b096460.txt">Table of n, a(n) for n=1..1000</a> %F A096460 a(n+1) = a(n) + A008472(a(n)), n > 1. - _Reinhard Zumkeller_, Jul 16 2012 %e A096460 Given a(30)=22704 whose prime factorization is 2^4*3*11*43, add to a(30) its unique prime factors (2+3+11+43)=59 to give a(31)=22704+59=22763. %t A096460 NestList[#+Total[Transpose[FactorInteger[#]][[1]]]&,1,40] (* _Harvey P. Dale_, Nov 24 2011 *) %o A096460 (Haskell) %o A096460 a096460 n = a096460_list !! (n-1) %o A096460 a096460_list = 1 : iterate (\x -> x + a008472 x) 2 %o A096460 -- _Reinhard Zumkeller_, Jul 16 2012 %Y A096460 Cf. A008472. %K A096460 nonn,nice %O A096460 1,2 %A A096460 _Gil Broussard_, Aug 12 2004 %E A096460 Definition corrected May 10 2008