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 A339875 #7 Dec 28 2020 09:51:29 %S A339875 561,6601,8481,17733,23001,30889,54741,62745,88561,106141,319965, %T A339875 359601,449065,534061,609301,949785,1357621,2162721,2288661,2615977, %U A339875 3284281,4005001,4698001,4830805,5381265,6313681,6594721,6840001,8093701,11782005,11921001,14665105,14892153,15217741,16577785,19683001,20154061,20441701 %N A339875 Intersection of A137409 and A339870: Composite numbers k of the form 4u+1 having more than one prime factor of type 4u+3, and for which the odd part of phi(k) divides k-1. %C A339875 Composite numbers k of the form 4u+1 for which the odd part of phi(k) divides k-1 and for which A065338(k) > 1. %C A339875 All terms k are squarefree and the 3-adic valuation of A065338(k) is a nonzero even number. %o A339875 (PARI) %o A339875 A065338(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = (f[i, 1]%4)); factorback(f); }; %o A339875 isA137409(n) = ((1==n)||(A065338(n)>1)); \\ _Antti Karttunen_, Dec 26 2020 %o A339875 A000265(n) = (n>>valuation(n, 2)); %o A339875 isA339870(n) = ((n>1)&&!isprime(n)&&(1==(n%4))&&!((n-1)%A000265(eulerphi(n)))); %o A339875 isA339875(n) = (isA137409(n)&&isA339870(n)); %Y A339875 Intersection of A137409 and A339870. %Y A339875 Cf. A000010, A000265, A053575, A065338. %K A339875 nonn %O A339875 1,1 %A A339875 _Antti Karttunen_, Dec 26 2020