A010719 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A010719

Period 2: repeat {5,8}.

5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

COMMENTS

The inverse binomial transform is 5, 3, -6, 12, -24, 48, -96, 192, -384, 768, ... essentially A110164. - R. J. Mathar, Feb 25 2023

LINKS

Table of n, a(n) for n=0..80.

Index entries for linear recurrences with constant coefficients, signature (0,1).

FORMULA

a(n) = a(n-2) for n > 1; a(0) = 5, a(1) = 8. G.f.: (5+8*x)/((1-x)*(1+x)). - Vincenzo Librandi, Aug 01 2010

a(n) = 3*(n mod 2) + 5. - Wesley Ivan Hurt, Jun 14 2014

MAPLE