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 A328636 #7 Oct 27 2019 17:32:56
%S A328636 20,22,26,40,44,46,68,70,86,92,220,224,238,248,270,272,286,356,370,
%T A328636 424,428,500,538,544,584,622,630,682,728,766,836,896,910,934,980,1018,
%U A328636 1124,1162,1208,1230,1232,1246,1306,1376,1390,1460,1520,1558,1604,1642,1706,1748,1786,1856,1870,1930,2000,2038,2084,2144,2182,2228,2266
%N A328636 Numbers n for which A328578(n) = A257993(A276086(A276086(n))) = 6.
%C A328636 Numbers n for which A276087(n) is a multiple of 2310, but not of 13.
%H A328636 Antti Karttunen, <a href="/A328636/b328636.txt">Table of n, a(n) for n = 1..10000</a>
%H A328636 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%o A328636 (PARI)
%o A328636 A257993(n) = { for(i=1,oo,if(n%prime(i),return(i))); }
%o A328636 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A328636 A328578(n) = A257993(A276086(A276086(n)));
%o A328636 isA328636(n) = (6==A328578(n));
%Y A328636 Row 6 of A328631.
%Y A328636 Cf. A257993, A276086, A328578.
%K A328636 nonn
%O A328636 1,1
%A A328636 _Antti Karttunen_, Oct 27 2019