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.

A324579 Numbers n for which n*A276086(n) is a product of primorial numbers (is a term of A025487).

This page as a plain text file.
%I A324579 #12 Mar 09 2019 19:23:44
%S A324579 1,2,4,6,8,16,30,36,40,72,210,240,252,256,2310,2520,2560,2592,2808,
%T A324579 5184,30030,32832,510510,573300,9699690,223092870,232792560
%N A324579 Numbers n for which n*A276086(n) is a product of primorial numbers (is a term of A025487).
%C A324579 Sequence is infinite because each primorial number (A002110) is present.
%H A324579 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%H A324579 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%o A324579 (PARI)
%o A324579 A276086(n) = { my(i=0,m=1,pr=1,nextpr); while((n>0),i=i+1; nextpr = prime(i)*pr; if((n%nextpr),m*=(prime(i)^((n%nextpr)/pr));n-=(n%nextpr));pr=nextpr); m; };
%o A324579 A324580(n) = n*A276086(n);
%o A324579 A322585(n) = { my(f = factor(n)); for(i=1,#f~,if((primepi(f[i,1])!=i)||((i>1)&&(f[i-1,2]<f[i,2])),return(0))); (1); };
%o A324579 isA324579(n) = A322585(A324580(n));
%Y A324579 Subsequence of A324578.
%Y A324579 Cf. A002110 (a subsequence), A025487, A276086, A324580, A322585.
%K A324579 nonn,more
%O A324579 1,2
%A A324579 _Antti Karttunen_, Mar 09 2019