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

%I #10 Aug 27 2020 13:38:59

%S 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 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 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 Coefficient of x^a(n) in (x-1)*(x-2)*...*(x-n) is the largest one (not in absolute value).

%H Robert Israel, <a href="/A076622/b076622.txt">Table of n, a(n) for n = 1..10000</a>

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

%e (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 N:= 200: # for a(1)..a(N)

%p V:= Vector(N): L:= <1>:

%p for n from 1 to N do

%p L:= -n*<L,0> + <0, L>;

%p V[n]:= max[index](L)[1]-1

%p od:

%p convert(V,list); # _Robert Israel_, Aug 27 2020

%Y Cf. A065048.

%K nonn

%O 1,4

%A _Benoit Cloitre_, Nov 10 2002

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 July 21 01:14 EDT 2024. Contains 374462 sequences. (Running on oeis4.)