login
A187102
Minimum number of function evaluations in each step of an explicit Runge-Kutta method of order n.
1
1, 2, 3, 4, 6, 7, 9, 11
OFFSET
1,2
COMMENTS
a(n)>=n+3 for n>=8 (Butcher 1985).
FORMULA
a(n) = min{k; A187103(k)=n}.
CROSSREFS
Sequence in context: A339509 A060233 A235203 * A191991 A369138 A257047
KEYWORD
hard,more,nonn
AUTHOR
STATUS
approved