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 A324110 #12 Jul 17 2021 11:23:52
%S A324110 15,21,30,33,35,39,42,45,51,55,57,60,63,65,66,69,70,75,77,78,84,85,90,
%T A324110 91,93,95,99,102,105,110,111,114,115,117,119,120,123,126,129,130,132,
%U A324110 133,135,138,140,141,143,145,147,150,153,154,155,156,159,161,165,168,170,171,175,177,180,182,183,185,186,187,189,190,195,198,201
%N A324110 Numbers k such that A324108(k) != A324054(k-1).
%C A324110 This is a subsequence of A070537. The missing terms 1, 87, 174, 348, 696, 1392, 2091, ..., are at A324111.
%H A324110 Antti Karttunen, <a href="/A324110/b324110.txt">Table of n, a(n) for n = 1..10000</a>
%o A324110 (PARI)
%o A324110 A324054(n) = { my(p=2,mp=p*p,m=1); while(n, if(!(n%2), p=nextprime(1+p); mp = p*p, if(3==(n%4),mp *= p,m *= (mp-1)/(p-1))); n>>=1); (m); };
%o A324110 A324108(n) = { my(f=factor(n)); prod(i=1, #f~, A324054((f[i,1]^f[i,2])-1)); };
%o A324110 isA324110(n) = (A324054(n-1)!=A324108(n));
%o A324110 for(n=1,201,if(isA324110(n), print1(n,", ")))
%Y A324110 Cf. A070537, A324054, A324108, A324109 (complement), A324111.
%K A324110 nonn
%O A324110 1,1
%A A324110 _Antti Karttunen_ and _David A. Corneth_, Feb 15 2019