cp's OEIS Frontend

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.

A076622 Coefficient of x^a(n) in (x-1)*(x-2)*...*(x-n) is the largest one (not in absolute value).

Original entry on oeis.org

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, 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, 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
Offset: 1

Views

Author

Benoit Cloitre, Nov 10 2002

Keywords

Examples

			(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
		

Crossrefs

Cf. A065048.

Programs

  • Maple
    N:= 200: # for a(1)..a(N)
    V:= Vector(N): L:= <1>:
    for n from 1 to N do
      L:= -n*  + <0, L>;
      V[n]:= max[index](L)[1]-1
    od:
    convert(V,list); # Robert Israel, Aug 27 2020

Formula

Is a(n)-floor(log(n)) bounded ?