Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131080
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131080 Periodic sequence (4, 4, 3, 1, 0, 0, 1, 3). +0
6
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; listen)
OFFSET

1,1

COMMENT

Third column of triangular array T defined in A131074.

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 (ppl(AT)spl.at), Jun 19 2007

PROGRAM

(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: A034933 A021697 A016707 this_sequence A010657 A019706 A016497

Adjacent sequences: A131077 A131078 A131079 this_sequence A131081 A131082 A131083

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research