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.
%I A334215 #10 Apr 20 2020 09:55:10
%S A334215 1,1,2,1,1,3,1,1,1,4,1,1,1,2,5,1,1,1,1,1,6,1,1,1,1,1,1,7,1,1,1,1,1,1,
%T A334215 1,8,1,1,1,1,1,1,1,2,9,1,1,1,1,1,1,1,2,3,10,1,1,1,1,1,1,1,1,1,1,11,1,
%U A334215 1,1,1,1,1,1,1,1,1,1,12,1,1,1,1,1,1,1,1
%N A334215 T(n, k) is the greatest positive integer m such that m^k divides n; square array T(n, k), n, k > 0 read by antidiagonals downwards.
%F A334215 T(n, 1) = n.
%F A334215 T(n, 2) = A000188(n).
%F A334215 T(n, 3) = A053150(n).
%F A334215 T(n, 4) = A053164(n).
%F A334215 T(n, A051903(n)) = A261969(n).
%F A334215 T(n, k) = 1 for any k > A051903(n).
%F A334215 T(n^k, k) = n.
%e A334215 Square array starts:
%e A334215 n\k| 1 2 3 4 5 6 7 8 9 10
%e A334215 ---+-------------------------------
%e A334215 1| 1 1 1 1 1 1 1 1 1 1
%e A334215 2| 2 1 1 1 1 1 1 1 1 1
%e A334215 3| 3 1 1 1 1 1 1 1 1 1
%e A334215 4| 4 2 1 1 1 1 1 1 1 1
%e A334215 5| 5 1 1 1 1 1 1 1 1 1
%e A334215 6| 6 1 1 1 1 1 1 1 1 1
%e A334215 7| 7 1 1 1 1 1 1 1 1 1
%e A334215 8| 8 2 2 1 1 1 1 1 1 1
%e A334215 9| 9 3 1 1 1 1 1 1 1 1
%e A334215 10| 10 1 1 1 1 1 1 1 1 1
%e A334215 11| 11 1 1 1 1 1 1 1 1 1
%e A334215 12| 12 2 1 1 1 1 1 1 1 1
%e A334215 13| 13 1 1 1 1 1 1 1 1 1
%e A334215 14| 14 1 1 1 1 1 1 1 1 1
%e A334215 15| 15 1 1 1 1 1 1 1 1 1
%e A334215 16| 16 4 2 2 1 1 1 1 1 1
%o A334215 (PARI) T(n,k) = { my (f=factor(n)); prod (i=1, #f~, f[i,1]^(f[i,2]\k)) }
%Y A334215 Cf. A000188, A051903, A053150, A053164, A060175, A261969, A334215, A334216.
%K A334215 nonn,tabl
%O A334215 1,3
%A A334215 _Rémy Sigrist_, Apr 19 2020