(adsbygoogle = window.adsbygoogle || []).push({}); how to find a mathematical formula for this recursion??

i got this recursion

b(0,0)=1Code (Text):

int b(int n,int count) {

int i;

count =a(n,count);

for(i=0;i<n;i++)

count =b(i,count);

return count;

b(1,0)=3

b(1,1)=4

b(2,0)=8

the formula for function "a" is a(n,c)=2^n + c

what is the formal way to find a formula for b

so i could predict whats the output of each input like b(12,15)??

i dont have any intuition

i am looking for the formal way

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# How to find a mathematical formula for this recursion?

Loading...

Similar Threads - find mathematical formula | Date |
---|---|

3-D simulation software with mathematical parameters | Feb 22, 2018 |

Can't find my Localhost Database Engine for SQL Server | Feb 16, 2018 |

C/++/# Finding duplicates algorithm | Jan 20, 2018 |

C/++/# Is there an easy way to find ints i,j,k satisfying i*j=k^2? | May 19, 2017 |

C/++/# Program to find combination of letters associated with phone | Mar 1, 2017 |

**Physics Forums - The Fusion of Science and Community**