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 A096291 #6 Dec 31 2023 16:35:11 %S A096291 1,4,5,6,3,9,18,27,27,1,18,27,18,9,45,27,54,54,63,15,45,72,81,72,72, %T A096291 81,126,72,72,27,63,81,90,81,117,99,135,135,117,54,171,144,135,144, %U A096291 126,171,225,126,180,72,207,162,126,162,180,198,207,234,234,135,225,207,225,270 %N A096291 Sum of digits(product of nonzero digits(n^n)). %C A096291 Conjecture: a(n) = a(n+1) for infinitely many positive integers. Largest found is n=2577, i.e. sd(pnd(2577^2577)) = sd(pnd(2578^2578)) = 18315. %Y A096291 Cf. A051801, A007953. %K A096291 base,easy,nonn %O A096291 1,2 %A A096291 _Jason Earls_, Jun 24 2004