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.

A284695 Greatest prime number appearing in the prime tower factorization of n (when n > 1); a(1) = 1.

This page as a plain text file.
%I A284695 #4 Apr 02 2017 10:03:16
%S A284695 1,2,3,2,5,3,7,3,3,5,11,3,13,7,5,2,17,3,19,5,7,11,23,3,5,13,3,7,29,5,
%T A284695 31,5,11,17,7,3,37,19,13,5,41,7,43,11,5,23,47,3,7,5,17,13,53,3,11,7,
%U A284695 19,29,59,5,61,31,7,3,13,11,67,17,23,7,71,3,73,37,5
%N A284695 Greatest prime number appearing in the prime tower factorization of n (when n > 1); a(1) = 1.
%C A284695 See A182318 for the definition of the prime tower factorization of a number.
%C A284695 a(n) >= A006530(n) for any n>0.
%H A284695 Rémy Sigrist, <a href="/A284695/b284695.txt">Table of n, a(n) for n = 1..10000</a>
%F A284695 a(n) = A006530(A279513(n)) for any n>0.
%e A284695 8 = 2^3, hence a(8) = max(2, 3) = 3.
%Y A284695 Cf. A006530, A182318, A279513, A284694.
%K A284695 nonn
%O A284695 1,2
%A A284695 _Rémy Sigrist_, Apr 01 2017