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 A193925 #8 Feb 16 2025 08:33:15
%S A193925 0,0,1,1,-11,1,-1289,1644721,2705106905705,7317603371292879756764065,
%T A193925 53547319099556919431874542743248407878119975324235
%N A193925 a(n) = a(n-1)^2 - n^(n-2) + n.
%C A193925 Example of a recursive sequence which produces a table containing three ones.
%H A193925 Arkadiusz Wesolowski, <a href="/A193925/b193925.txt">Table of n, a(n) for n = 0..14</a>
%H A193925 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/RecursiveSequence.html">Recursive Sequence</a>
%F A193925 a(0) = 0, a(n) = a(n-1)^2 - n^(n-2) + n.
%e A193925 a(4) = -11 because a(3) = 1 and 1^2 - 4^(4-2) + 4 = -11.
%t A193925 RecurrenceTable[{a[n] == a[n - 1]^2 - n^(n - 2) + n, a[0] == 0}, a, {n, 10}]
%o A193925 (PARI) print1(a=0, ", "); for(n=1, 10, print1(a=a^2-n^(n-2)+n, ", "));
%Y A193925 Cf. A003095, A000272.
%K A193925 easy,sign
%O A193925 0,5
%A A193925 _Arkadiusz Wesolowski_, Aug 09 2011