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.

A346469 a(n) = A340070(A276086(n)).

This page as a plain text file.
%I A346469 #14 Aug 14 2021 22:20:31
%S A346469 0,1,1,5,3,3,1,7,8,31,3,3,5,5,5,5,120,15,25,25,50,25,75,75,125,125,
%T A346469 125,125,750,375,1,9,10,41,3,3,12,59,71,247,3,3,5,5,5,5,15,15,50,25,
%U A346469 25,25,75,75,375,125,125,125,375,375,7,7,7,7,210,21,7,7,7,7,21,21,420,35,35,35,7455,105,175,175,175,3325
%N A346469 a(n) = A340070(A276086(n)).
%H A346469 Antti Karttunen, <a href="/A346469/b346469.txt">Table of n, a(n) for n = 0..11550</a>
%H A346469 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A346469 a(n) = A340070(A276086(n)) = gcd(A327860(n), A329029(n)).
%F A346469 For n >= 1, a(n) = A327860(n) / A345930(n).
%o A346469 (PARI) A346469(n) = { my(s=0, t=0, m=1, p=2, e); while(n, e = (n%p); if(e, m *= (p^e); s += (1/p); t += (e/p)); n = n\p; p = nextprime(1+p)); (gcd(s,t)*m); };
%Y A346469 Cf. A003415, A069359, A276086, A327860, A329029, A340070, A345930.
%Y A346469 Cf. also A346471.
%K A346469 nonn,base,look
%O A346469 0,4
%A A346469 _Antti Karttunen_, Jul 21 2021