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 A362738 #23 Aug 06 2023 14:12:14 %S A362738 0,0,192,3000,46440,823200,16776704,387419760,9999999000,285311669280, %T A362738 8916100446528,302875106590056,11112006825555272,437893890380856000, %U A362738 18446744073709547520,827240261886336759264,39346408075296537569592,1978419655660313589117120,104857599999999999999992000 %N A362738 a(n) is the least nonnegative integer solution for y such that x > 1 is an integer in the equation n^y*x^n = n^(x^(1/n)). %C A362738 Corresponding solutions for x are 256 (2^(2^3)) at n = 2, 19683 (3^(3^2)) at n = 3 and n^(n^2) for all n > 3. %C A362738 Further solution pairs are of the form y = n^(n^k) - n^(2+k) and x = n^(n^(1+k)) with k > 0. %F A362738 E.g.f.: 1/(1 + LambertW(-x)) - x*(1 + 3*x + x^2)*exp(x) + 2*x^2, where LambertW() is the Lambert W-function. %F A362738 a(n) = n^n - n^3 for n > 2. %o A362738 (PARI) a(n) = max(0,n^n-n^3) %Y A362738 Cf. A000312, A058126, A073084. %K A362738 nonn,easy %O A362738 2,3 %A A362738 _Thomas Scheuerle_, May 01 2023