Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131027
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131027 Periodic sequence (4, 3, 1, 0, 1, 3). +0
11
4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1, 0, 1, 3, 4, 3, 1 (list; graph; listen)
OFFSET

1,1

COMMENT

Third column of triangular array T defined in A131022.

a(n) = abs(A078070(n+1)).

FORMULA

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

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

a(n)=1/30*{-(n mod 6)-6*[(n+1) mod 6]-[(n+2) mod 6]+9*[(n+3) mod 6]+14*[(n+4) mod 6]+9*[(n+5) mod 6]}, with n>=0. - Paolo P. Lava (ppl(AT)spl.at), Jun 19 2007

PROGRAM

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

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

CROSSREFS

Cf. A131022, A078070. Other columns of T are in A088911, A131026, A131028, A131029, A131030.

Sequence in context: A120362 A010102 A054669 this_sequence A133475 A021236 A136590

Adjacent sequences: A131024 A131025 A131026 this_sequence A131028 A131029 A131030

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), following a suggestion of Paul Curtz (bpcrtz(AT)free.fr), Jun 10 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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research