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 A076622 #10 Aug 27 2020 13:38:59 %S A076622 1,0,1,2,1,2,1,2,1,2,1,2,3,2,3,2,3,2,3,2,3,2,3,2,3,2,3,2,3,2,3,2,3,2, %T A076622 3,2,3,2,3,2,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4, %U A076622 3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3,4,3 %N A076622 Coefficient of x^a(n) in (x-1)*(x-2)*...*(x-n) is the largest one (not in absolute value). %H A076622 Robert Israel, <a href="/A076622/b076622.txt">Table of n, a(n) for n = 1..10000</a> %F A076622 Is a(n)-floor(log(n)) bounded ? %e A076622 (x-1)(x-2)(x-3) = x^3 - 6*x^2 + 11*x - 6, 11 is the largest coefficient for x^1, hence a(3)=1 %p A076622 N:= 200: # for a(1)..a(N) %p A076622 V:= Vector(N): L:= <1>: %p A076622 for n from 1 to N do %p A076622 L:= -n*<L,0> + <0, L>; %p A076622 V[n]:= max[index](L)[1]-1 %p A076622 od: %p A076622 convert(V,list); # _Robert Israel_, Aug 27 2020 %Y A076622 Cf. A065048. %K A076622 nonn %O A076622 1,4 %A A076622 _Benoit Cloitre_, Nov 10 2002