|
Search: id:A074877
|
|
|
| A074877 |
|
Number of function calls required to compute ack(3,n), where ack denotes the Ackermann function. |
|
+0
1
|
|
| 15, 106, 541, 2432, 10307, 42438, 172233, 693964, 2785999, 11164370, 44698325, 178875096, 715664091, 2862983902, 11452590817, 45811673828, 183249316583, 733002509034, 2932020521709, 11728103058160, 46912454175475
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
The Ackermann function is defined recursively for nonnegative integers m,n by: ack(0,n) = n + 1 if m=0; ack(m,0) = ack(m-1,1) if m>0 and n=0; ack(m,n) = ack(m-1,ack(m,n-1)) otherwise.
|
|
REFERENCES
|
Y. Sundblad, The Ackermann function. A theoretical, computational, and formula manipulative study. Nordisk Tidskr. Informationsbehandling (BIT) 11 1971 107-119.
|
|
LINKS
|
Gert Bultman, Ackermann function.
E. Weisstein, Ackermann function.
Wikipedia, Ackermann function.
|
|
FORMULA
|
G.f.: (15-14*x+8*x^2)/((4*x-1)*(2*x-1)*(x-1)^2); recurrence: a(n) = 8*a(n-1)-21*a(n-2)+22*a(n-3)-8*a(n-4); a(n) = 128/3*4^n-40*2^n+3*n+37/3 for n>=0 - Pab Ter (pabrlos(AT)yahoo.com), May 29 2004
|
|
CROSSREFS
|
Sequence in context: A077261 A012507 A041426 this_sequence A055504 A060931 A107585
Adjacent sequences: A074874 A074875 A074876 this_sequence A074878 A074879 A074880
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jeff Medha (medha_jeff(AT)yahoo.co.in), Sep 12 2002
|
|
EXTENSIONS
|
Edited by Pab Ter (pabrlos(AT)yahoo.com), May 29 2004
|
|
|
Search completed in 0.002 seconds
|
