A385817 Irregular triangle read by rows listing the lengths of maximal runs (sequences of consecutive elements increasing by 1) of binary indices, duplicate rows removed.
1, 2, 1, 1, 3, 2, 1, 1, 2, 4, 1, 1, 1, 3, 1, 2, 2, 1, 3, 5, 2, 1, 1, 1, 2, 1, 4, 1, 1, 1, 2, 3, 2, 2, 3, 1, 4, 6, 1, 1, 1, 1, 3, 1, 1, 2, 2, 1, 1, 3, 1, 5, 1, 2, 1, 2, 1, 2, 2, 4, 2, 1, 1, 3, 3, 3, 2, 4, 1, 5, 7, 2, 1, 1, 1, 1, 2, 1, 1, 4, 1, 1, 1, 1, 2, 1
Offset: 0
Examples
The binary indices of 53 are {1,3,5,6}, with maximal runs ((1),(3),(5,6)), with lengths (1,1,2). After removing duplicates, this is our row 16. Triangle begins: 0: . 1: 1 2: 2 3: 1 1 4: 3 5: 2 1 6: 1 2 7: 4 8: 1 1 1 9: 3 1 10: 2 2 11: 1 3 12: 5 13: 2 1 1 14: 1 2 1 15: 4 1 16: 1 1 2 17: 3 2 18: 2 3 19: 1 4 20: 6 21: 1 1 1 1
Crossrefs
Programs
-
Mathematica
DeleteDuplicates[Table[Length/@Split[Join@@Position[Reverse[IntegerDigits[n,2]],1],#2==#1+1&],{n,0,100}]]
Comments