cp's OEIS Frontend

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.

A358765 a(n) = A003415(n)*A276086(n) mod 60, where A003415 is the arithmetic derivative and A276086 is the primorial base exp-function.

This page as a plain text file.
%I A358765 #10 Dec 08 2022 16:32:25
%S A358765 0,0,3,6,36,18,25,10,0,0,15,30,40,50,15,0,0,30,45,10,0,0,45,30,20,20,
%T A358765 45,30,0,30,37,14,0,48,57,12,0,10,45,0,0,30,35,50,0,30,15,30,20,20,45,
%U A358765 0,0,30,15,20,0,0,45,30,8,38,51,54,12,36,5,10,0,0,15,30,0,50,45,30,0,0,55,10,0,0,15
%N A358765 a(n) = A003415(n)*A276086(n) mod 60, where A003415 is the arithmetic derivative and A276086 is the primorial base exp-function.
%H A358765 Antti Karttunen, <a href="/A358765/b358765.txt">Table of n, a(n) for n = 0..60060</a>
%H A358765 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A358765 a(n) = A358669(n) mod 60.
%o A358765 (PARI)
%o A358765 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A358765 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A358765 A358765(n) = ((A003415(n)*A276086(n))%60);
%Y A358765 Cf. A003415, A276086, A358669, A358850.
%Y A358765 Cf. A016825 (positions of odd terms), A042965 (of even terms), A235992 (of multiples of 4), A067019 (of terms of the form 4k+2).
%K A358765 nonn
%O A358765 0,3
%A A358765 _Antti Karttunen_, Dec 06 2022