A128179 A097807 * A002260.
1, 0, 2, 1, 0, 3, 0, 2, 0, 4, 1, 0, 3, 0, 5, 0, 2, 0, 4, 0, 6, 1, 0, 3, 0, 5, 0, 7, 0, 2, 0, 4, 0, 6, 0, 8, 1, 0, 3, 0, 5, 0, 7, 0, 9, 0, 2, 0, 4, 0, 6, 0, 8, 0, 10
Offset: 1
Examples
From _Boris Putievskiy_, Feb 05 2013: (Start) The start of the sequence as a table: 1, 0, 1, 0, 1, 0, 1, ... 2, 0, 2, 0, 2, 0, 2, ... 3, 0, 3, 0, 3, 0, 3, ... 4, 0, 4, 0, 4, 0, 4, ... 5, 0, 5, 0, 5, 0, 5, ... 6, 0, 6, 0, 6, 0, 6, ... 7, 0, 7, 0, 7, 0, 7, ... ... (End) First few rows of the triangle: 1; 0, 2; 1, 0, 3; 0, 2, 0, 4; 1, 0, 3, 0, 5; 0, 2, 0, 4, 0, 6; 1, 0, 3, 0, 5, 0, 7; ...
Links
- Boris Putievskiy, Transformations [of] Integer Sequences And Pairing Functions arXiv:1212.2732 [math.CO], 2012.
Formula
From Boris Putievskiy, Feb 05 2013: (Start)
T(n,k) = (1-(-1)^k)*n/2;
a(n) = (1-(-1)^j)*i/2, where i = n-t*(t+1)/2, j = (t*t+3*t+4)/2-n, t = floor((-1+sqrt(8*n-7))/2). (End)
Comments