login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076622 Coefficient of x^a(n) in (x-1)*(x-2)*...*(x-n) is the largest one (not in absolute value). 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
Is a(n)-floor(log(n)) bounded ?
EXAMPLE
(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
MAPLE
N:= 200: # for a(1)..a(N)
V:= Vector(N): L:= <1>:
for n from 1 to N do
L:= -n*<L, 0> + <0, L>;
V[n]:= max[index](L)[1]-1
od:
convert(V, list); # Robert Israel, Aug 27 2020
CROSSREFS
Cf. A065048.
Sequence in context: A259656 A096370 A330721 * A194513 A344018 A245040
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Nov 10 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 29 15:32 EDT 2024. Contains 372114 sequences. (Running on oeis4.)