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 A376299 #24 Oct 19 2024 08:33:57 %S A376299 1,4,90,120 %N A376299 Fixed points of A008473. %C A376299 These are the numbers such that the sum of the powerfree parts of the divisors of n equals n. %C A376299 These fixed points appeared in A299352 and the linked Combo Class video. The former notes there are no more fixed points <= 10^8. - _Michael S. Branicky_, Sep 19 2024 %C A376299 Any further terms are > 10^11. - _Lucas A. Brown_, Oct 19 2024 %H A376299 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/A376299.py">Python program</a>. %H A376299 Combo Class, <a href="https://www.youtube.com/watch?v=pylw9t4j6bM">The Mysterious Pattern I Found Within Prime Factorizations</a>, Sep 12 2024. %o A376299 (Python) %o A376299 from sympy import factorint, prod %o A376299 A008473 = lambda n: prod(sum(pk) for pk in factorint(n).items()) %o A376299 isok = lambda n: A008473(n) == n %o A376299 print([n for n in range(1, 10**6) if isok(n)]) %Y A376299 Cf. A008473, A299352. %K A376299 nonn,more,hard %O A376299 1,2 %A A376299 _Darío Clavijo_, Sep 19 2024