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.

A336965 a(n) is the product of the distinct prime numbers appearing in the prime tower factorization of n.

This page as a plain text file.
%I A336965 #12 Aug 13 2020 10:11:38
%S A336965 1,2,3,2,5,6,7,6,6,10,11,6,13,14,15,2,17,6,19,10,21,22,23,6,10,26,3,
%T A336965 14,29,30,31,10,33,34,35,6,37,38,39,30,41,42,43,22,30,46,47,6,14,10,
%U A336965 51,26,53,6,55,42,57,58,59,30,61,62,42,6,65,66,67,34,69,70
%N A336965 a(n) is the product of the distinct prime numbers appearing in the prime tower factorization of n.
%C A336965 The prime tower factorization of a number is defined in A182318.
%C A336965 For any n > 0, a(n) is the product of the terms in n-th row of A336964.
%H A336965 Rémy Sigrist, <a href="/A336965/b336965.txt">Table of n, a(n) for n = 1..10000</a>
%e A336965 A001221(a(n)) = A115588(n) for any n > 1.
%e A336965 a(n) = A007947(A279513(n)).
%e A336965 a(n) = n iff n is squarefree (A005117).
%o A336965 (PARI) a(n) = { my (f=factor(n), v=vecprod(f[,1]~)); for (k=1, #f~, v=lcm(v, a(f[k,2]))); v }
%Y A336965 Cf. A001221, A005117, A007947, A115588, A182318, A336964.
%K A336965 nonn
%O A336965 1,2
%A A336965 _Rémy Sigrist_, Aug 09 2020