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.

A347232 a(n) = A346485(A276086(n)), where A346485 is Möbius transform of A342001.

This page as a plain text file.
%I A347232 #9 Nov 03 2021 22:31:23
%S A347232 0,1,1,3,1,1,1,5,6,14,4,4,1,1,2,2,0,0,1,1,2,2,0,0,1,1,2,2,0,0,1,7,8,
%T A347232 20,6,6,10,34,44,92,24,24,6,6,12,12,0,0,6,6,12,12,0,0,6,6,12,12,0,0,1,
%U A347232 1,2,2,0,0,4,4,8,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,2,2,0,0,4,4,8,8
%N A347232 a(n) = A346485(A276086(n)), where A346485 is Möbius transform of A342001.
%H A347232 Antti Karttunen, <a href="/A347232/b347232.txt">Table of n, a(n) for n = 0..11550</a>
%H A347232 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A347232 a(n) = A346485(A276086(n)).
%o A347232 (PARI)
%o A347232 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A347232 A003557(n) = (n/factorback(factorint(n)[, 1]));
%o A347232 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A347232 A342001(n) = (A003415(n) / A003557(n));
%o A347232 A346485(n) = sumdiv(n,d,moebius(n/d)*A342001(d));
%o A347232 A347232(n) = A346485(A276086(n));
%Y A347232 Cf. A003415, A003557, A276086, A342001, A346485.
%Y A347232 Cf. also A342002, A346471, A347126, A347396.
%K A347232 nonn,base
%O A347232 0,4
%A A347232 _Antti Karttunen_, Aug 26 2021