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.

A322312 a(n) = Product_{d|n, d+1 is prime} prime(1+A286561(n,d+1)), where A286561(n,k) gives the k-valuation of n (for k > 1).

This page as a plain text file.
%I A322312 #12 Dec 03 2018 18:29:53
%S A322312 2,6,2,20,2,18,2,28,2,12,2,120,2,6,2,88,2,60,2,60,2,12,2,168,2,6,2,40,
%T A322312 2,72,2,104,2,6,2,800,2,6,2,168,2,54,2,40,2,12,2,528,2,12,2,40,2,84,2,
%U A322312 56,2,12,2,1440,2,6,2,136,2,72,2,20,2,24,2,2240,2,6,2,20,2,36,2,528,2,12,2,720,2,6,2,112,2
%N A322312 a(n) = Product_{d|n, d+1 is prime} prime(1+A286561(n,d+1)), where A286561(n,k) gives the k-valuation of n (for k > 1).
%H A322312 Antti Karttunen, <a href="/A322312/b322312.txt">Table of n, a(n) for n = 1..16384</a>
%F A322312 a(n) = Product_{d|n} A000040(1+A286561(n,1+d))^A010051(1+d).
%F A322312 a(n) = A181819(A185633(n)).
%F A322312 For all n, A001222(a(n)) = A067513(n).
%o A322312 (PARI) A322312(n) = { my(m=1,p); fordiv(n,d,p=1+d; if(isprime(p), for(i=0,oo,if(n%(p^i),m *= prime(i);break)))); (m); };
%Y A322312 Cf. A067513, A185633, A286561, A322313 (rgs-transform), A322314.
%Y A322312 Cf. also A293514, A322310.
%K A322312 nonn
%O A322312 1,1
%A A322312 _Antti Karttunen_, Dec 03 2018