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 A324879 #12 Jul 02 2021 01:53:50 %S A324879 1,9,15,16,21,27,35,39,55,57,64,75,77,85,87,90,91,95,99,105,111,115, %T A324879 119,125,129,133,143,147,155,159,161,175,183,185,189,195,201,203,205, %U A324879 209,213,221,235,237,243,245,253,256,259,265,267,275,285,287,295,299,301,303,319,321,323,325,335,339,341,351,355,363,365 %N A324879 Numbers k such that A324863(k) is equal to A324874(k). %C A324879 In range 1..10000, there are only three such numbers k for which A324868(k) == A000120(A324866(k)): 1, 9, 125. See A324201. %H A324879 Antti Karttunen, <a href="/A324879/b324879.txt">Table of n, a(n) for n = 1..2240</a> (based on Hans Havermann's factorization of A156552) %H A324879 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %H A324879 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %H A324879 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a> %o A324879 (PARI) for(n=1,oo,if(A324863(n)==A324874(n), print1(n,", "))); %Y A324879 Cf. A000120, A324863, A324866, A324868, A324874. %Y A324879 Subsequences: A324201, A324880 (even terms). %K A324879 nonn %O A324879 1,2 %A A324879 _Antti Karttunen_, Mar 27 2019