GATE Questions & Answers of Combinatorics: Counting, Recurrence Relations, Generating Functions

What is the Weightage of Combinatorics: Counting, Recurrence Relations, Generating Functions in GATE Exam?

Total 1 Questions have been asked from Combinatorics: Counting, Recurrence Relations, Generating Functions topic of Discrete Mathematics subject in previous GATE papers. Average marks 1.00.

Which one of the following is a closed form expression for the generating function of the sequence $\style{font-family:'Times New Roman'}{\left\{a_n\right\}\;,}$ where $\style{font-family:'Times New Roman'}{a_n=2n+3}$ for all $\style{font-family:'Times New Roman'}{n=0,1,2,.....?} $