|
%I #12 May 13 2018 08:53:29
%S 9,58,283,1244,5213,21342,86367,347488,1394017,5584226,22353251,
%T 89445732,357848421,1431524710,5726360935,22905967976,91624920425,
%U 366501778794,1466011309419,5864053626220,23456231282029,93824958682478,375299901838703,1501199741572464
%N Number of function calls of the first kind required to compute ack(3,n), where ack denotes the Ackermann function.
%C The distinction between different kinds of recursive calls is based on a naive implementation of the Ackermann function in C.
%C int ack(int m, int n)
%C {
%C // Final result
%C ....if (m==0) return n + 1;
%C .
%C // Recursive calls of the first kind:
%C ....if (n==0) return ack(m - 1, 1);
%C .
%C // Recursive calls of the second kind:
%C ....return ack(m - 1, ack(m, n - 1));
%C }
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (8,-21,22,-8).
%F G.f.: (8*x^2-14*x+9)/((4*x-1)*(2*x-1)*(x-1)^2). - _Alois P. Heinz_, May 12 2018
%Y Cf. A036563, A074877, A304371.
%K nonn,easy
%O 0,1
%A _Olivier Gérard_, May 11 2018
|
