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.

A323734 a(n) is the largest number j whose n-th power has exactly j divisors.

This page as a plain text file.
%I A323734 #6 Jan 27 2019 08:47:38
%S A323734 1,2,3,40,45,1,7,225,153,640,4851,6348,325,19474560,1,976,18513,1225,
%T A323734 19,107747640000,81,1,23,245790720,49,2601,2133,3025,94221,
%U A323734 56241820800,31,20063232,4225,15262600,4761,19236456,37,25462407801600,5929,2952832000,21921921
%N A323734 a(n) is the largest number j whose n-th power has exactly j divisors.
%C A323734 a(n) is the largest (and last) of the A323731(n) numbers in row n of A323730.
%C A323734 If a(n)=1 then n is a term in A323732; otherwise, n is a term in A323733.
%H A323734 Jon E. Schoenfield, <a href="/A323734/b323734.txt">Table of n, a(n) for n = 0..100</a>
%e A323734 The numbers j whose 3rd powers have exactly j divisors are 1, 28, and 40; the largest of these is 40, so a(3) = 40.
%e A323734 The only number j whose 5th power has exactly j divisors is 1, so a(1) = 1.
%Y A323734 Cf. A000005, A073049, A323730, A323731, A323732, A323733.
%K A323734 nonn
%O A323734 0,2
%A A323734 _Jon E. Schoenfield_, Jan 26 2019