A154529 A090040 mod 9.

1, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8

Offset

0,2

Comments

For n>2, equal to 2^(n-2) mod 9 [From Michael B. Porter, Feb 02 2010]

Apart from leading terms the same as A146501, A153130 and A029898. [From R. J. Mathar, Apr 13 2010]

Links

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

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

Formula

a(n)=a(n-1)-a(n-3)+a(n-4), n>4. G.f.: (6*x^4+2*x^3+4*x+1-4*x^2)/((1-x)*(1+x)*(x^2-x+1)). [From R. J. Mathar, Feb 25 2009]

Mathematica

Join[{1}, LinearRecurrence[{1, 0, -1, 1}, {5, 1, 2, 4}, 101]] (* Ray Chandler, Jul 15 2015 *)

Crossrefs

Sequence in context: A120579 A093316 A085758 * A352375 A157823 A159703

Adjacent sequences: A154526 A154527 A154528 * A154530 A154531 A154532

Keyword

nonn,easy

Author

Paul Curtz, Jan 11 2009

Extensions

Edited by N. J. A. Sloane, Jan 12 2009

Extended by Ray Chandler, Jul 15 2015

Status

approved