• Support PF! Buy your school textbooks, materials and every day products Here!

Find a recurrence relation

  • Thread starter tgt
  • Start date
  • #1
tgt
520
2

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?
 
Last edited:

Answers and Replies

  • #2
Gib Z
Homework Helper
3,346
4
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.
 
  • #3
tgt
520
2
What happens if there is no elementary recurrence relation? What recurrence relation might it have then?
 
  • #4
tgt
520
2
I can give you one more term in the recurrence relation,
1,1,2,5,12,47,135,...

It is most likely non elementary
 
  • #5
Defennder
Homework Helper
2,591
5
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.
 
  • #6
tgt
520
2
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?
 
  • #7
Gib Z
Homework Helper
3,346
4
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.
 
  • #8
tgt
520
2
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?
 
  • #9
Gib Z
Homework Helper
3,346
4
No you should probably put it in the form I did for full marks.
 
  • #10
655
3
It's not in Sloane, surprisingly.
 
  • #11
tgt
520
2
It's not in Sloane, surprisingly.
What do you mean? I don't understand.
 
  • #12
655
3
Sloane's rather comprehensive encyclopedia of integer sequences.
 

Related Threads for: Find a recurrence relation

  • Last Post
Replies
6
Views
771
  • Last Post
Replies
1
Views
877
  • Last Post
Replies
3
Views
1K
Replies
4
Views
2K
  • Last Post
Replies
2
Views
8K
Replies
1
Views
1K
Replies
0
Views
896
Replies
1
Views
2K
Top