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.

A348991 a(n) = A333791(A276086(n)).

This page as a plain text file.
%I A348991 #11 Nov 13 2021 22:33:24
%S A348991 0,0,0,1,0,4,0,3,2,12,8,39,0,18,12,67,48,214,0,93,62,342,248,1089,0,
%T A348991 468,312,1717,1248,5464,0,5,4,20,16,65,2,30,24,109,90,346,12,155,124,
%U A348991 554,460,1751,62,780,624,2779,2310,8776,312,3905,3124,13904,11560,43901,0,40,32,153,128,492,16,219,178,788,664,2495
%N A348991 a(n) = A333791(A276086(n)).
%H A348991 Antti Karttunen, <a href="/A348991/b348991.txt">Table of n, a(n) for n = 0..11550</a>
%H A348991 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%o A348991 (PARI)
%o A348991 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A348991 A332993(n) = if(1==n,n,n + A332993(n/vecmin(factor(n)[,1])));
%o A348991 A332994(n) = if(1==n,n,n + A332994(n/vecmax(factor(n)[,1])));
%o A348991 A333791(n) = (A332993(n)-A332994(n));
%o A348991 A348991(n) = A333791(A276086(n));
%Y A348991 Cf. A276086, A332993, A332994, A333791.
%Y A348991 Cf. A060735 (gives the positions of other zeros after the initial a(0)=0).
%K A348991 nonn,base,look
%O A348991 0,6
%A A348991 _Antti Karttunen_, Nov 07 2021