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 A233203 #19 Dec 17 2024 15:15:26
%S A233203 1,0,1,3,16,97,729,6433,65536,756680,9765625,139312339,2176782336,
%T A233203 36972058910,678223072849,13363461010158,281474976710656,
%U A233203 6311342330065435,150094635296999121,3773536025353076151,100000000000000000000,2785962590401641140642,81402749386839761113321
%N A233203 a(n) = floor(n^n / 2^n).
%F A233203 a(n) = floor((n/2)^n).
%e A233203 a(5) = floor(5^5 / 2^5) = floor(3125 / 32) = 97.
%p A233203 A233203:=n->floor((n/2)^n); seq(A233203(n), n=0..30); # _Wesley Ivan Hurt_, Feb 26 2014
%t A233203 Table[Floor[(n/2)^n], {n, 0, 30}] (* _Wesley Ivan Hurt_, Feb 26 2014 *)
%o A233203 (Python)
%o A233203 for n in range(33): print(n**n >> n, end=', ')
%o A233203 (PARI) a(n) = n^n\2^n; \\ _Michel Marcus_, Dec 17 2024
%Y A233203 Cf. A000079, A000312, A178537 (n^n mod 2^n for odd n), A206344.
%Y A233203 Bisection gives: A062206 (even part).
%K A233203 nonn
%O A233203 0,4
%A A233203 _Alex Ratushnyak_, Dec 05 2013