Hi.

I was wondering about the problem of finding "analytical" formulas for tetration, that is, formulas that are more like "formulas" than "procedures" to compute tetration. This includes, e.g. infinite sums and other things like that. A "closed form" formula, that is, one in terms of a finite number of "conventional" functions, is most likely not possible.

Now, it seems the Riemann mappings so far are hugely resistant to attempts to describe them, so I was curious on concentrating on the simpler problem of describing the regular iteration, which is what the Riemann mappings would deform.

The regular tetrational, or "unipolar superfunction" of , can be given by

with recursively-generated coefficients

.

with the "complete" Bell polynomials.

The above series is a Fourier series, but can be rearranged into a Taylor series if we so please:

The problem, then, is the description of the coefficients . The first few are:

...

By pattern recognition, it appears that

.

The denominator can be given in true closed form via the "q-Pochhammer symbol" as

.

(The appearance of q-analogs is curious. I'm wondering about the connections between q-analogs, tetration, iteration, fractals, chaos, and continuum sums...)

The problem, however, is the sequence of "magic" numbers for the numerators. For j starting at 0, we get

n = 1: 1

n = 2: 1

n = 3: 2, 1

n = 4: 6, 6, 5, 1

n = 5: 24, 36, 46, 40, 24, 9, 1

n = 6: 120, 240, 390, 480, 514, 416, 301, 160, 64, 14, 1

n = 7: 720, 1800, 3480, 5250, 7028, 8056, 8252, 7426, 5979, 4208, 2542, 1295, 504, 139, 20, 1

n = 8: 5040, 15120, 33600, 58800, 91014, 124250, 155994, 177220, 186810, 181076, 163149, 134665, 102745, 71070, 44605, 24550, 11712, 4543, 1344, 265, 27, 1

n = 9: 40320, 141120, 352800, 695520, 1204056, 1855728, 2640832, 3473156, 4277156, 4942428, 5395818, 5561296, 5433412, 5021790, 4391304, 3625896, 2820686, 2056845, 1398299, 879339, 504762, 260613, 117748, 45178, 13845, 3156, 461, 35, 1

n = 10: 362880, 1451520, 4021920, 8769600, 16664760, 28264320, 44216040, 64324680, 88189476, 114342744, 141184014, 166279080, 187614312, 202901634, 210825718, 210403826, 201934358, 186191430, 164980407, 140216446, 114231817, 88934355, 66047166, 46576620, 31071602, 19460271, 11365652, 6112650, 2987358, 1298181, 488878, 153094, 37692, 6705, 749, 44, 1

...

The first column appears to be factorials, i.e. , the last is of course , and the second-to-last looks to be but beyond that I'm not sure. Is there some way to actually prove or disprove these results from the recurrence formula, and even better, to get a "real" (perhaps a sum/product) formula for the coefficients ?

What I'm really after here is some way to analyze that recurrence formula. How would one go about approaching such a problem?

Also,

for all its worth (I just plugged 1, 3, 18, 180, 2700 into the oeis.org dictionary.). For all that's worth. I don't know how you could decompose that in a "useful" manner.

But again, no proofs, just guesses.

I was wondering about the problem of finding "analytical" formulas for tetration, that is, formulas that are more like "formulas" than "procedures" to compute tetration. This includes, e.g. infinite sums and other things like that. A "closed form" formula, that is, one in terms of a finite number of "conventional" functions, is most likely not possible.

Now, it seems the Riemann mappings so far are hugely resistant to attempts to describe them, so I was curious on concentrating on the simpler problem of describing the regular iteration, which is what the Riemann mappings would deform.

The regular tetrational, or "unipolar superfunction" of , can be given by

with recursively-generated coefficients

.

with the "complete" Bell polynomials.

The above series is a Fourier series, but can be rearranged into a Taylor series if we so please:

The problem, then, is the description of the coefficients . The first few are:

...

By pattern recognition, it appears that

.

The denominator can be given in true closed form via the "q-Pochhammer symbol" as

.

(The appearance of q-analogs is curious. I'm wondering about the connections between q-analogs, tetration, iteration, fractals, chaos, and continuum sums...)

The problem, however, is the sequence of "magic" numbers for the numerators. For j starting at 0, we get

n = 1: 1

n = 2: 1

n = 3: 2, 1

n = 4: 6, 6, 5, 1

n = 5: 24, 36, 46, 40, 24, 9, 1

n = 6: 120, 240, 390, 480, 514, 416, 301, 160, 64, 14, 1

n = 7: 720, 1800, 3480, 5250, 7028, 8056, 8252, 7426, 5979, 4208, 2542, 1295, 504, 139, 20, 1

n = 8: 5040, 15120, 33600, 58800, 91014, 124250, 155994, 177220, 186810, 181076, 163149, 134665, 102745, 71070, 44605, 24550, 11712, 4543, 1344, 265, 27, 1

n = 9: 40320, 141120, 352800, 695520, 1204056, 1855728, 2640832, 3473156, 4277156, 4942428, 5395818, 5561296, 5433412, 5021790, 4391304, 3625896, 2820686, 2056845, 1398299, 879339, 504762, 260613, 117748, 45178, 13845, 3156, 461, 35, 1

n = 10: 362880, 1451520, 4021920, 8769600, 16664760, 28264320, 44216040, 64324680, 88189476, 114342744, 141184014, 166279080, 187614312, 202901634, 210825718, 210403826, 201934358, 186191430, 164980407, 140216446, 114231817, 88934355, 66047166, 46576620, 31071602, 19460271, 11365652, 6112650, 2987358, 1298181, 488878, 153094, 37692, 6705, 749, 44, 1

...

The first column appears to be factorials, i.e. , the last is of course , and the second-to-last looks to be but beyond that I'm not sure. Is there some way to actually prove or disprove these results from the recurrence formula, and even better, to get a "real" (perhaps a sum/product) formula for the coefficients ?

What I'm really after here is some way to analyze that recurrence formula. How would one go about approaching such a problem?

Also,

for all its worth (I just plugged 1, 3, 18, 180, 2700 into the oeis.org dictionary.). For all that's worth. I don't know how you could decompose that in a "useful" manner.

But again, no proofs, just guesses.