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 A096301 #10 Dec 31 2023 16:34:43 %S A096301 1,4,9,3,1,14,10,21,20,1,4,20,40,10,81,64,72,8,14,3,7,32,24,15,5,20, %T A096301 72,18,42,18,32,10,14,8,12,14,14,60,18,2,24,15,9,30,18,30,84,27,75,5, %U A096301 16,8,15,168,32,27,20,56,28,24,128,20,180,224,70,15,60,120,196,90,144,200,24 %N A096301 Product of nonzero digits(sum of digits(n^n)). %C A096301 Conjecture: a(n) = a(n+1) for infinitely many positive integers. Largest found is n=4462, i.e. pnd(sd(4462^4462)) = pnd(sd(4463^4463)) = 126. %H A096301 Harvey P. Dale, <a href="/A096301/b096301.txt">Table of n, a(n) for n = 1..1000</a> %t A096301 Array[Times@@Select[IntegerDigits[Total[IntegerDigits[#^#]]],#>0&]&,80] (* _Harvey P. Dale_, Sep 30 2012 *) %Y A096301 Cf. A051801, A007953. %K A096301 base,easy,nonn %O A096301 1,2 %A A096301 _Jason Earls_, Jun 25 2004