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.

A346474 a(n) = A342414(A276086(n)).

This page as a plain text file.
%I A346474 #14 Aug 14 2021 22:20:17
%S A346474 0,1,1,5,1,7,1,7,1,31,13,41,1,9,11,37,2,47,3,11,7,43,19,53,1,13,17,49,
%T A346474 11,59,1,3,5,41,17,55,1,59,71,247,53,317,19,73,23,289,127,359,13,29,
%U A346474 113,331,37,401,11,101,67,373,169,443,1,11,13,47,5,61,17,23,43,277,121,347,1,83,107,319,71,389,31,97,8,361,163
%N A346474 a(n) = A342414(A276086(n)).
%C A346474 For n >= 1, each term a(n) is a divisor of A342002(n).
%H A346474 Antti Karttunen, <a href="/A346474/b346474.txt">Table of n, a(n) for n = 0..13860</a>
%H A346474 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A346474 a(n) = A342414(A276086(n)).
%F A346474 a(n) = A327860(n) / gcd(A327860(n), A324650(n)).
%o A346474 (PARI)
%o A346474 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A346474 A342414(n) = { my(u=A003415(n)); (u/gcd(eulerphi(n),u)); };
%o A346474 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A346474 A346474(n) = A342414(A276086(n));
%Y A346474 Cf. A000010, A003415, A276086, A324650, A327860, A342414.
%Y A346474 Cf. also A342002, A345930, A346475 for sequences with similar scatter plots.
%K A346474 nonn,base,look
%O A346474 0,4
%A A346474 _Antti Karttunen_, Jul 21 2021