Triangular array: T(n,k) is the number of binary necklaces (no turning over) of length n whose longest run of 1's has length k. Table begins at n=0, k=0.

A063686

Triangular array: T(n,k) is the number of binary necklaces (no turning over) of length n whose longest run of 1's has length k. Table begins at n=0, k=0.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =1a(8) =1a(9) =1a(10) =1a(11) =2a(12) =1a(13) =1a(14) =1a(15) =1a(16) =2a(17) =2a(18) =1a(19) =1a(20) =1a(21) =1a(22) =4a(23) =4a(24) =2a(25) =1a(26) =1a(27) =1a(28) =1a(29) =4

External references