login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131080 Periodic sequence (4, 4, 3, 1, 0, 0, 1, 3). 5
4, 4, 3, 1, 0, 0, 1, 3, 4, 4, 3, 1, 0, 0, 1, 3, 4, 4, 3, 1, 0, 0, 1, 3, 4, 4, 3, 1, 0, 0, 1, 3, 4, 4, 3, 1, 0, 0, 1, 3, 4, 4, 3, 1, 0, 0, 1, 3, 4, 4, 3, 1, 0, 0, 1, 3, 4, 4, 3, 1, 0, 0, 1, 3, 4, 4, 3, 1, 0, 0, 1, 3, 4, 4, 3, 1, 0, 0, 1, 3, 4, 4, 3, 1, 0, 0, 1, 3, 4, 4, 3, 1, 0, 0, 1, 3, 4, 4, 3, 1, 0, 0, 1, 3, 4 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Third column of triangular array T defined in A131074.

LINKS

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

FORMULA

a(1) = a(2) = 4, a(3) = a(8) = 3, a(4) = a(7) = 1, a(5) = a(6) = 0; for n > 8, a(n) = a(n-8).

G.f.: (4-x^2-2*x^3+3*x^4)/((1-x)*(1+x^4)).

a(n)=1/56*{-3*(n mod 8)-10*[(n+1) mod 8]-3*[(n+2) mod 8]+4*[(n+3) mod 8]+11*[(n+4) mod 8]+18*[(n+5) mod 8]+11*[(n+6) mod 8]+4*[(n+7) mod 8]}, with n>=0. - Paolo P. Lava (paoloplava(AT)gmail.com), Jun 19 2007

PROG

(PARI) {m=105; for(n=1, m, r=(n-1)%8; print1(if(r<2, 4, if(r==2||r==7, 3, if(r==3||r==6, 1, 0))), ", "))}

(MAGMA) m:=105; [ [4, 4, 3, 1, 0, 0, 1, 3][(n-1) mod 8 + 1]: n in [1..m] ];

CROSSREFS

Cf. A131074, A131027.

Sequence in context: A188657 A021697 A016707 * A010657 A019706 A016497

Adjacent sequences:  A131077 A131078 A131079 * A131081 A131082 A131083

KEYWORD

nonn,easy,less

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), following a suggestion of Paul Curtz (bpcrtz(AT)free.fr), Jun 14 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 18 00:14 EST 2012. Contains 206085 sequences.