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 A328635 #8 Oct 27 2019 17:32:49
%S A328635 10,14,38,58,62,112,166,176,214,218,226,240,360,650,658,660,780,844,
%T A328635 848,856,1080,1200,1280,1288,1474,1478,1486,1500,1620,1910,1918,1920,
%U A328635 2040,2104,2108,2116,2312,2314,2318,2386,2396,2440,2450,2504,2520,2546,2580,2700,2732,2744,2752,2950,3000,3120,3176,3362,3374,3382,3420
%N A328635 Numbers n for which A328578(n) = A257993(A276086(A276086(n))) = 5.
%C A328635 Numbers n for which A276087(n) is a multiple of 210, but not of 11.
%H A328635 Antti Karttunen, <a href="/A328635/b328635.txt">Table of n, a(n) for n = 1..10000</a>
%H A328635 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%o A328635 (PARI)
%o A328635 A257993(n) = { for(i=1,oo,if(n%prime(i),return(i))); }
%o A328635 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A328635 A328578(n) = A257993(A276086(A276086(n)));
%o A328635 isA328635(n) = (5==A328578(n));
%Y A328635 Row 5 of A328631.
%Y A328635 Cf. A257993, A276086, A328578.
%K A328635 nonn
%O A328635 1,1
%A A328635 _Antti Karttunen_, Oct 27 2019