Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,1

COMMENT

Second column of triangular array T defined in A131022.

a(n) = A021823(n+2).

FORMULA

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

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

a(n)=1/30*{-3*(n mod 6)-3*[(n+1) mod 6]+2*[(n+2) mod 6]+7*[(n+3) mod 6]+7*[(n+4) mod 6]+2*[(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<2, 2, if(r==2||r==5, 1, 0)), ", "))}

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

CROSSREFS

Cf. A131022, A021823. Other columns of T are in A088911, A131027, A131028, A131029, A131030.

Adjacent sequences: A131023 A131024 A131025 this_sequence A131027 A131028 A131029

Sequence in context: A049783 A024712 A021823 this_sequence A014604 A015199 A051168

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 October 6 12:54 EDT 2008. Contains 144667 sequences.


AT&T Labs Research