This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A209919 Triangle read by rows: T(n,k), 0 <= k <= n-1, = number of 2-divided binary sequences of length n which are 2-divisible in exactly k ways. 3
 0, 3, 1, 4, 2, 2, 6, 3, 4, 3, 8, 6, 6, 6, 6, 14, 9, 11, 10, 11, 9, 20, 18, 18, 18, 18, 18, 18, 36, 30, 33, 30, 34, 30, 33, 30, 60, 56, 56, 58, 56, 56, 58, 56, 56, 108, 99, 105, 99, 105, 100, 105, 99, 105, 99, 188, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 352, 335, 344, 338, 346, 335, 348, 335, 346, 338, 344, 335, 632, 630, 630, 630, 630, 630, 630, 630, 630, 630, 630, 630, 630, 1182, 1161, 1179, 1161, 1179, 1161, 1179, 1162, 1179, 1161, 1179, 1161, 1179, 1161, 2192, 2182, 2182, 2188, 2182, 2184, 2188, 2182, 2182, 2188, 2184, 2182, 2188, 2182, 2182 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS See A210109 for further information. Omitting the leading column, triangle has mirror symmetry. Speculation: T(2n+1,2)=T(2n+1,1); T(2n,2)=T(2n,1)+T(n,1); T(3n+1,3)=T(3n+1,1); T(3n+2,3)=T(3n+2,1); T(3n,3)=T(3n,1)+T(n,1) and similar "lagged modulo sums" for T(4n+i,4)=T(4n+i,2), 0

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 October 18 18:56 EDT 2019. Contains 328197 sequences. (Running on oeis4.)