I would appreciate if somebody could help me with the following problem:
Q: How to find $a_n=?$
$$(n+1)a_{n+2}-na_{n+1}-a_{n}=0,a_1=1, a_2=0$$
0
closed as off-topic by user223391, JonMark Perry, Lord Shark the Unknown, Joel Reyes Noche, Wouter Feb 21 '18 at 5:15
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Community, JonMark Perry, Lord Shark the Unknown, Wouter
2
$\begingroup$
$\endgroup$
Hint: Let us multiply both sides by $n!$
$(n+1)!a_{n+2}=n(n!a_{n+1})+n((n-1)!a_{n})$
We now let $(n-1)!a_n=b_n$
$b_{n+2}=n(b_{n+1}+b_n)$
Now, it is a recurrence form similar to derangement.
deleted Apr 2 at 14:47
-
$\begingroup$ Could you give a reference to what you call a derangement ? $\endgroup$ – Jean Marie May 7 '16 at 12:33
-
$\begingroup$ en.wikipedia.org/wiki/Derangement I believe this should do it. $\endgroup$ – Sinpoint May 7 '16 at 12:36
-
$\begingroup$ A quick computation with Mathematica confirms that $a_n=1/2, 2/3, 9/4, 44/5, 265/6, 1854/7, 14833/8,...$ etc... whose numerators are members of the OEIS sequence A000166 oeis.org of derangements. $\endgroup$ – Jean Marie May 7 '16 at 12:54