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.

A380529 Smallest prime p such that p^p is a divisor of A380459(A005117(n)), or 1 if no such factor exists, where A380459(n) = Product_{d|n} A276086(n/d)^A349394(d) and A005117 lists the squarefree numbers.

This page as a plain text file.
%I A380529 #6 Feb 09 2025 10:23:39
%S A380529 1,1,1,1,1,1,3,1,1,1,2,1,1,2,3,1,1,1,3,1,2,3,2,1,1,2,1,5,1,3,1,2,1,2,
%T A380529 2,3,1,1,1,2,3,1,2,3,1,1,1,2,5,1,3,1,2,1,2,1,2,2,3,2,1,1,3,1,2,3,1,1,
%U A380529 3,2,1,5,2,3,2,1,2,1,2,3,1,2,1,1,3,1,2,3,2,2,1,1,1,3,2,1,1,2,2,1,2,3,1,3,1
%N A380529 Smallest prime p such that p^p is a divisor of A380459(A005117(n)), or 1 if no such factor exists, where A380459(n) = Product_{d|n} A276086(n/d)^A349394(d) and A005117 lists the squarefree numbers.
%H A380529 Antti Karttunen, <a href="/A380529/b380529.txt">Table of n, a(n) for n = 1..39845</a>
%H A380529 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>.
%F A380529 a(n) = A380528(A005117(n)) = A129252(A380459(A005117(n))).
%o A380529 (PARI) for(n=1,oo,if(issquarefree(n),print1(A380528(n),", ")));
%Y A380529 Cf. A005117, A129252, A276086, A349394, A380459, A380468, A380470, A380528.
%K A380529 nonn
%O A380529 1,7
%A A380529 _Antti Karttunen_, Feb 09 2025