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.

A347126 a(n) = A347129(A276086(n)).

This page as a plain text file.
%I A347126 #10 Aug 30 2021 21:52:12
%S A347126 0,1,1,10,3,21,1,14,16,124,39,246,3,27,33,222,72,423,6,44,56,344,114,
%T A347126 636,10,65,85,490,165,885,1,18,20,164,51,330,24,236,284,1976,636,3804,
%U A347126 57,438,552,3468,1143,6462,104,696,904,5296,1776,9624,165,1010,1340,7460,2535,13290,3,33,39,282,90,549,51,414,516
%N A347126 a(n) = A347129(A276086(n)).
%H A347126 Antti Karttunen, <a href="/A347126/b347126.txt">Table of n, a(n) for n = 0..11550</a>
%H A347126 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A347126 a(n) = A347129(A276086(n)).
%o A347126 (PARI)
%o A347126 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A347126 A003557(n) = (n/factorback(factorint(n)[, 1]));
%o A347126 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A347126 A347130(n) = sumdiv(n,d,d*A003415(n/d));
%o A347126 A347129(n) = (A347130(n) / A003557(n));
%o A347126 A347126(n) = A347129(A276086(n));
%Y A347126 Cf. A003415, A003557, A276086, A347129, A347130.
%Y A347126 Cf. also A342002, A346471, A347232.
%K A347126 nonn,base,look
%O A347126 0,4
%A A347126 _Antti Karttunen_, Aug 25 2021