login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A309237 Records in the indices of largest unsigned Stirling number of first kind: a(n) = smallest m such that c(m,n) = max_{k=0,1...,m} c(m,k). 2
0, 1, 2, 8, 25, 73, 204, 565, 1557, 4275, 11710, 32022, 87464, 238692 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Smallest m such that A065048(m-1) = c(m,n).

For k in the interval [a(n),a(n+1)-1], A065048(k-1) = c(k,n).

Ratio a(n+1)/a(n) seems to decrease and tend to exp(1) as n grows.

LINKS

Table of n, a(n) for n=0..13.

EXAMPLE

n=2 is a value for index k delivering the maximum value of c(m,k) for each fixed m in the interval [a(2),a(3)-1] = [2,7]. Then, for m in [a(3),a(4)-1] = [8,24], the maximum is given by c(m,3), and so on.

PROG

(PARI) { A309237(n) = my(t=prod(i=1, n-1, x+i+O(x^n)), m=n); while( polcoef(t, n-1)-polcoef(t, n-2) < 0, t*=x+m; m++); m; }

CROSSREFS

Cf. A000254, A000399, A008275, A065048.

Sequence in context: A301819 A119854 A176855 * A037560 A138804 A212323

Adjacent sequences:  A309234 A309235 A309236 * A309238 A309239 A309240

KEYWORD

nonn,more

AUTHOR

Max Alekseyev, Jul 17 2019

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 20:41 EST 2019. Contains 329777 sequences. (Running on oeis4.)