Find a recurrence relation

[tgt]

Homework Statement

Find the recurrence relation to

1,1,2,5,12,47,....

The Attempt at a Solution

Made all sorts of attempts. I'm not experienced with these things.

Was there a site that works these things out for you?

 

[Gib Z]

Do you have more terms? It might have no elementary relation. If you have more terms, list the difference between each consecutive terms. This forms a new sequence, do the same to this sequence. Keep doing it until the difference is a constant number. If it took you n times to do it, the relation is a polynomial of degree n.

 

[tgt]

What happens if there is no elementary recurrence relation? What recurrence relation might it have then?

 

[tgt]

I can give you one more term in the recurrence relation,
1,1,2,5,12,47,135,...

It is most likely non elementary

 

[Defennder]

Why don't you post the entire question here without truncating the series? Otherwise, it'll be difficult for the posters here to figure out the answer without even having the complete question to begin with.

 

[tgt]

Would it still be a recurrence relation if the relation was a function of n only? i.e a_n = f(n) where f(n) is a function of n.

What if a_n=f(n) where a_0 is in f(n)? Is a_n still a recurrence relation?

 

[Gib Z]

Depends what f(n) is. For example if f(n) = 2^n, then yours sequence is still the recurrence relation a_0 =1 , a_n+1 = 2 a_n.

 

[tgt]

Depends what f(n) is. For example if f(n) = 2^n, then yours sequence is still the recurrence relation a_0 =1 , a_n+1 = 2 a_n.

So if the question stated give any recurrence relation and I wrote down f(n)=2^n and only that , would it be full marks?

 

[Gib Z]

No you should probably put it in the form I did for full marks.

 

[maze]

It's not in Sloane, surprisingly.

 

[tgt]

It's not in Sloane, surprisingly.

What do you mean? I don't understand.

 

[maze]

Sloane's rather comprehensive encyclopedia of integer sequences.