# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a176149 Showing 1-1 of 1 %I A176149 #14 Feb 08 2021 05:19:45 %S A176149 1,1,1,1,3,1,1,3,3,1,1,5,3,5,1,1,5,3,3,5,1,1,7,6,3,6,7,1,1,7,6,3,3,6, %T A176149 7,1,1,9,6,7,3,7,6,9,1,1,9,9,7,3,3,7,9,9,1,1,11,9,7,8,3,8,7,9,11,1 %N A176149 Triangle T(n, k) = n + 1 - mod(n, k+1) - mod(n, n-k+1), read by rows. %C A176149 Row sums are: 1, 2, 5, 8, 15, 18, 31, 34, 49, 58, 75, ... %H A176149 G. C. Greubel, Rows n = 0..100 of the triangle, flattened %F A176149 T(n, k) = n + 1 - mod(n, k+1) - mod(n, n-k+1). %e A176149 Triangle begins as: %e A176149 1; %e A176149 1, 1; %e A176149 1, 3, 1; %e A176149 1, 3, 3, 1; %e A176149 1, 5, 3, 5, 1; %e A176149 1, 5, 3, 3, 5, 1; %e A176149 1, 7, 6, 3, 6, 7, 1; %e A176149 1, 7, 6, 3, 3, 6, 7, 1; %e A176149 1, 9, 6, 7, 3, 7, 6, 9, 1; %e A176149 1, 9, 9, 7, 3, 3, 7, 9, 9, 1; %e A176149 1, 11, 9, 7, 8, 3, 8, 7, 9, 11, 1; %t A176149 Table[n+1 -Mod[n, k+1] -Mod[n, n-k+1], {n,0,10}, {k,0,n}]//Flatten %o A176149 (Sage) flatten([[n+1 - n%(k+1) - n%(n-k+1) for k in (0..n)] for n in (0..12)]) # _G. C. Greubel_, Feb 07 2021 %o A176149 (Magma) [n+1 - n mod (k+1) - n mod (n-k+1): k in [0..n], n in [0..12]]; // _G. C. Greubel_, Feb 07 2021 %Y A176149 Cf. A176151. %K A176149 nonn,tabl,easy %O A176149 0,5 %A A176149 _Roger L. Bagula_, Apr 10 2010 %E A176149 Edited by _G. C. Greubel_, Feb 07 2021 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE