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.

A324651 Bisection of A324650: a(n) = A000010(A276086(2*n)).

This page as a plain text file.
%I A324651 #7 Mar 10 2019 19:32:36
%S A324651 1,2,6,4,8,24,20,40,120,100,200,600,500,1000,3000,6,12,36,24,48,144,
%T A324651 120,240,720,600,1200,3600,3000,6000,18000,42,84,252,168,336,1008,840,
%U A324651 1680,5040,4200,8400,25200,21000,42000,126000,294,588,1764,1176,2352,7056,5880,11760,35280,29400,58800,176400,147000,294000,882000,2058
%N A324651 Bisection of A324650: a(n) = A000010(A276086(2*n)).
%H A324651 Antti Karttunen, <a href="/A324651/b324651.txt">Table of n, a(n) for n = 0..15015</a>
%H A324651 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%H A324651 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%F A324651 a(n) = A324650(2*n) = A000010(A276086(2*n)).
%o A324651 (PARI)
%o A324651 A324650(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)-1)*(prime(i)^(((n%nextpr)/pr)-1)); n-=(n%nextpr));pr=nextpr); (m); };
%o A324651 A324651(n) = A324650(n+n);
%o A324651 (PARI)
%o A324651 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 A324651 A324651(n) = eulerphi(A276086(n+n));
%Y A324651 Cf. A000010, A276086, A324650.
%K A324651 nonn
%O A324651 0,2
%A A324651 _Antti Karttunen_, Mar 10 2019