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 A333862 #20 Jun 14 2020 09:40:25 %S A333862 1,1,3,3,15,15,15,15,14,15,14,15,15,14,14,15,252,252,255,255,252,252, %T A333862 255,255,252,252,255,255,255,255,252,252,255,255,255,255,252,255,252, %U A333862 255,255,255,255,255,255,252,255,252,255,252,252,255,255,255,255,255 %N A333862 a(n) is the greatest nim-power of n. %C A333862 For any n >= 0, a(n) is the greatest term in n-th row of A335162. %H A333862 Rémy Sigrist, <a href="/A333862/a333862.txt">C program for A333862</a> %H A333862 <a href="/index/Ni#Nimmult">Index entries for sequences related to Nim-multiplication</a> %e A333862 For n = 10: %e A333862 - the first nim-powers of 10 are: 1, 10, 14, 13, 8, 1, ... %e A333862 - so a(10) = 14. %o A333862 (C) See Links section. %Y A333862 Cf. A335162. %K A333862 nonn %O A333862 0,3 %A A333862 _Rémy Sigrist_, Jun 13 2020