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 A325570 #9 May 11 2019 02:24:11 %S A325570 1,3,5,7,11,13,15,17,19,23,25,27,29,31,37,39,41,43,47,51,53,55,57,59, %T A325570 61,63,67,69,71,73,77,79,81,83,85,87,89,91,95,97,99,101,103,107,109, %U A325570 111,113,115,117,119,121,123,125,127,131,137,139,141,143,145,147,149,151,157,159,163,167,169,171,173,175,177,179,181 %N A325570 Numbers n that have no divisor d > 1 such that A048720(A065621(d),n/d) = n. %H A325570 Antti Karttunen, <a href="/A325570/b325570.txt">Table of n, a(n) for n = 1..10000</a> %o A325570 (PARI) %o A325570 A048720(b,c) = fromdigits(Vec(Pol(binary(b))*Pol(binary(c)))%2, 2); %o A325570 A065621(n) = bitxor(n-1,n+n-1); %o A325570 isA325570(n) = fordiv(n,d,if(A048720(A065621(n/d),d)==n,return(d==n))); %Y A325570 Cf. A048720, A065621, A115872, A115873. %Y A325570 Positions of ones in A325565 and A325566. %Y A325570 Cf. A065091 (a subsequence), A325571 (the composite terms), A325572 (complement). %Y A325570 Subsequence of A005408 (odd numbers). %K A325570 nonn %O A325570 1,2 %A A325570 _Antti Karttunen_, May 10 2019