A292564 Take 1, skip 3 * 1 - 1, take 2, skip 3 * 2 - 1, take 3, skip 3 * 3 - 1, ...
0, 3, 4, 10, 11, 12, 21, 22, 23, 24, 36, 37, 38, 39, 40, 55, 56, 57, 58, 59, 60, 78, 79, 80, 81, 82, 83, 84, 105, 106, 107, 108, 109, 110, 111, 112, 136, 137, 138, 139, 140, 141, 142, 143, 144, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 210, 211, 212
Offset: 0
Links
- Seiichi Manyama, Table of n, a(n) for n = 0..10000
- Michael Boardman, Proof Without Words: Pythagorean Runs, Math. Mag., 73 (2000), 59.
Programs
-
Maple
seq(seq(2*k^2+k+j,j=0..k),k=0..10); # Robert Israel, Sep 20 2017
Formula
a(n) = n + floor((sqrt(8*n+1)-1)/2)*(3*floor((sqrt(8*n+1)-1)/2)+1)/2. - Robert Israel, Sep 20 2017