This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A113045 Number triangle binomial(n,floor((n-k)/2)) mod 3. 1
 1, 1, 1, 2, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 0, 0, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS Row sums appear to be A051638. First row appears to be A039971. Diagonal sums are A113046. LINKS EXAMPLE Rows begin 1; 1,1; 2,1,1; 0,0,1,1; 0,1,1,1,1; 1,1,2,2,1,1; 2,0,0,0,0,1,1; CROSSREFS Sequence in context: A056979 A087812 A288384 * A204179 A204244 A083093 Adjacent sequences:  A113042 A113043 A113044 * A113046 A113047 A113048 KEYWORD easy,nonn,tabl AUTHOR Paul Barry, Oct 11 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 15 16:13 EDT 2019. Contains 324142 sequences. (Running on oeis4.)