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.

A339810 a(n) = A046523(A019565(n) - 1).

This page as a plain text file.
%I A339810 #5 Dec 19 2020 07:59:08
%S A339810 1,2,2,4,4,6,2,6,2,12,2,6,6,24,6,6,6,32,6,24,2,12,6,12,12,30,2,384,2,
%T A339810 6,2,12,4,6,6,64,6,6,2,60,2,48,6,6,12,60,2,6,30,12,2,210,2,96,2,216,
%U A339810 30,30,6,180,2,6,2,16,6,12,2,60,4,6,2,6,6,12,6,120,6,24,6,30,2,240,6,6,30,12,6,60,2,30,2,48
%N A339810 a(n) = A046523(A019565(n) - 1).
%H A339810 Antti Karttunen, <a href="/A339810/b339810.txt">Table of n, a(n) for n = 1..8192</a>
%F A339810 a(n) = A046523(A339809(n)) = A046523(A019565(n) - 1).
%o A339810 (PARI)
%o A339810 A019565(n) = { my(m=1, p=1); while(n>0, p = nextprime(1+p); if(n%2, m *= p); n >>= 1); (m); };
%o A339810 A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); }; \\ From A046523
%o A339810 A339810(n) = A046523(A019565(n)-1);
%Y A339810 Cf. A019565, A046523, A339809, A339811 (rgs-transform), A339812.
%K A339810 nonn
%O A339810 1,2
%A A339810 _Antti Karttunen_, Dec 18 2020