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.

A371086 Nonsquarefree numbers k such that A003557(k) divides A276086(k), where A003557(k) is k divided by its largest squarefree divisor, and A276086 is the primorial base exp-function.

This page as a plain text file.
%I A371086 #7 Mar 12 2024 20:13:48
%S A371086 9,25,45,49,50,63,75,98,99,117,147,153,171,175,207,225,242,245,261,
%T A371086 279,294,315,325,333,343,350,363,369,375,387,423,475,477,490,495,525,
%U A371086 531,539,549,550,585,603,605,625,639,650,657,693,711,726,735,747,765,775,801,819,825,833,847,850,855,873,909,925,927,931
%N A371086 Nonsquarefree numbers k such that A003557(k) divides A276086(k), where A003557(k) is k divided by its largest squarefree divisor, and A276086 is the primorial base exp-function.
%H A371086 Antti Karttunen, <a href="/A371086/b371086.txt">Table of n, a(n) for n = 1..10000</a>
%H A371086 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%o A371086 (PARI)
%o A371086 A003557(n) = (n/factorback(factor(n)[, 1]));
%o A371086 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A371086 isA371086(n) = (!issquarefree(n) && !(A276086(n)%A003557(n)));
%Y A371086 Intersection of A013929 and A371088.
%Y A371086 Cf. A003557, A276086, A371085 (subsequence).
%K A371086 nonn
%O A371086 1,1
%A A371086 _Antti Karttunen_, Mar 12 2024