Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #12 Jul 02 2021 01:53:50
%S 1,9,15,16,21,27,35,39,55,57,64,75,77,85,87,90,91,95,99,105,111,115,
%T 119,125,129,133,143,147,155,159,161,175,183,185,189,195,201,203,205,
%U 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 Numbers k such that A324863(k) is equal to A324874(k).
%C In range 1..10000, there are only three such numbers k for which A324868(k) == A000120(A324866(k)): 1, 9, 125. See A324201.
%H 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 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%o (PARI) for(n=1,oo,if(A324863(n)==A324874(n), print1(n,", ")));
%Y Cf. A000120, A324863, A324866, A324868, A324874.
%Y Subsequences: A324201, A324880 (even terms).
%K nonn
%O 1,2
%A _Antti Karttunen_, Mar 27 2019