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.

A079869 a(1)=1 and for n>1: round(n^(1/Omega(n)))^Omega(n), where Omega(n) is the total number of prime factors of n (A001222).

This page as a plain text file.
%I A079869 #7 Jun 17 2020 19:20:59
%S A079869 1,2,3,4,5,4,7,8,9,9,11,8,13,16,16,16,17,27,19,27,25,25,23,16,25,25,
%T A079869 27,27,29,27,31,32,36,36,36,16,37,36,36,81,41,27,43,64,64,49,47,32,49,
%U A079869 64,49,64,53,81,49,81,64,64,59,81,61,64,64,64,64,64,67,64,64,64,71,32,73
%N A079869 a(1)=1 and for n>1: round(n^(1/Omega(n)))^Omega(n), where Omega(n) is the total number of prime factors of n (A001222).
%C A079869 A079867(n)<=a(n)<=A079869(n); A020639(n)<=a(n)<=A006530(n);
%C A079869 a(m)=m=A079867(m)=A079871(m) iff m is a prime power (A000961).
%t A079869 ron[n_]:=Module[{c=PrimeOmega[n]},Round[n^(1/c)]^c]; Join[{1},Array[ ron,80,2]] (* _Harvey P. Dale_, Jun 17 2020 *)
%Y A079869 a(n)=A079868(n)^A001222(n). Cf. A079872, A068794, A068795.
%K A079869 nonn
%O A079869 1,2
%A A079869 _Reinhard Zumkeller_, Jan 13 2003