PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: Very high
[parent] Takeuchi number (Definition)

The $ n$th Takeuchi number $ T_n$ is the value of the function $ T(n, 0, n + 1)$ which measures how many times the Takeuchi function $ t(x, y, z)$ has to call itself to give the answer starting with $ x = n, y = 0, z = n + 1$. For example, the second Takeuchi number is 4, since $ t(2, 0, 3)$ requires four recursions to obtain the answer 2. The first few Takeuchi numbers are 0, 1, 4, 14, 53, 223, 1034, 5221, 28437, listed in A000651 of Sloane's OEIS. Prellberg gives a formula for the asymptotic growth of the Takeuchi numbers:

$\displaystyle T_n ~ cB_n\exp\left(\frac{1}{2W(n)^2}\right)$
, where $ c$ is the Takeuchi-Prellberg constant (approximately 2.2394331), $ B_n$ is the $ n$th Bernoulli number and $ W(x)$ is Lambert's $ W$ function.

Bibliography

1
Steven R. Finch Mathematical Constants New York: Cambridge University Press (2003): 321
2
T. Prellberg, ``On the asymptotics of Takeuchi numbers'', Symbolic computation, number theory, special functions, physics and combinatorics, Dordrecht: Kluwer Acad. Publ. (2001): 231 - 242.



"Takeuchi number" is owned by PrimeFan.
(view preamble)

View style:


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: Bernoulli number, growth, OEIS, Takeuchi function, measures, function

This is version 2 of Takeuchi number, born on 2007-09-21, modified 2007-09-21.
Object id is 9958, canonical name is TakeuchiNumber.
Accessed 252 times total.

Classification:
AMS MSC05A16 (Combinatorics :: Enumerative combinatorics :: Asymptotic enumeration)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)