Find a closed form for the generating function for each of these sequences. (Assume a general form for the terms of the sequence, using the most obvious choice of such a sequence.) a) −1, −1, −1, −1, −1, −1, −1, 0, 0, 0, 0, 0, 0, . . . b) 1, 3, 9, 27, 81, 243, 729, . . . c) 0, 0, 3, −3, 3, −3, 3, −3, . . . d) 1, 2, 1, 1, 1, 1, 1, 1, 1, . . .

Find a closed form for the generating function for each of these sequences. (Assume a general form for the terms of the sequence, using the most obvious choice of such a sequence.) a) −1, −1, −1, −1, −1, −1, −1, 0, 0, 0, 0, 0, 0, . . . b) 1, 3, 9, 27, 81, 243, 729, . . . c) 0, 0, 3, −3, 3, −3, 3, −3, . . . d) 1, 2, 1, 1, 1, 1, 1, 1, 1, . . .

College Algebra

1st Edition

ISBN:9781938168383

Author:Jay Abramson

Publisher:Jay Abramson

Chapter9: Sequences, Probability And Counting Theory

Section9.1: Sequences And Their Notations

Problem 70SE: Calculate the first eight terms of the sequences an=(n+2)!(n1)! and bn=n3+3n32n , and then make a...

See similar textbooks