In the limit of large n
, the recurrence relation reduces to c[n+1] == -c[n-1]]
. Consequently, the sum in the question is unbounded unless c[n] == 0
for some finite n
and beyond. However, this implies that all c[n]
vanish, unless a coefficient in the recurrence relation also vanishes at the same value of n
that the particular c[n]
vanishes. There is only one value of n
for which a coefficient vanishes, namely n = 1
, in which case,
RecurrenceTable[{c[n] == Sqrt[n - 1] c[n - 1] + Sqrt[n] c[n + 1],
c[1] == 0, c[0] == 1}, c, {n, 10}]
(* {1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0} *)
The sequence beginning with c[0] == -1
also satisfies the constraint, of course.
I do not believe that there are any other such sequences. For instance,
RecurrenceTable[{c[n] == Sqrt[n - 1] c[n - 1] + Sqrt[n] c[n + 1],
c[1] == 1., c[0] == 0}, c, {n, 9999989, 10000000}]
(* {-0.00529902, 0.0196947, 0.00530525, -0.019693 ,
-0.00531147, 0.0196914, 0.0053177 , -0.0196897,
-0.00532393, 0.019688 , 0.00533015, -0.0196863} *)