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 A328240 #13 Jul 02 2021 01:54:07 %S A328240 4,12,32,35,40,46,47,65,67,68,71,73,74,76,220,221,225,226,227,250,256, %T A328240 257,276,283,284,420,421,425,426,436,486,489,494,2324,2325,2352,2370, %U A328240 2387,2525,2530,2531,2555,2560,2565,2566,2583,2596,2734,2739,2760,2765,2769,2771,2773,2795,2797,2798,2803,4623,4627,4628 %N A328240 Numbers k such that the second arithmetic derivative of A276086(k) is prime. %C A328240 Numbers k for which A003415(A327860(k)) = A003415(A003415(A276086(k))) is a prime. %C A328240 Numbers k such that A276086(k) is in A192192, or equally, k such that A327860(k) is in A157037. %H A328240 Antti Karttunen, <a href="/A328240/b328240.txt">Table of n, a(n) for n = 1..1217</a> %H A328240 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a> %F A328240 For all n, a(A327969(n)) <= 5. %o A328240 (PARI) %o A328240 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1])); %o A328240 A327860(n) = { my(m=1, i=0, s=0, pr=1, nextpr); while((n>0), i=i+1; nextpr = prime(i)*pr; if((n%nextpr), my(e=((n%nextpr)/pr)); m *= (prime(i)^e); s += (e / prime(i)); n-=(n%nextpr)); pr=nextpr); (s*m); }; %o A328240 isA328240(n) = isprime(A003415(A327860(n))); %Y A328240 Cf. A003415, A157037, A192192, A276086, A327860, A327969, A328233. %Y A328240 Subsequence of A328116 and of A328242. %K A328240 nonn %O A328240 1,1 %A A328240 _Antti Karttunen_, Oct 10 2019