Array read by descending antidiagonals. A(n, k) is, if n > 0, the number of multiset permutations of {0, 1} of length n * k where the number of occurrences of 1 are multiples of n. A(0, k) = k + 1.
A361043
Array read by descending antidiagonals. A(n, k) is, if n > 0, the number of multiset permutations of {0, 1} of length n * k where the number of occurrences of 1 are multiples of n. A(0, k) = k + 1.
Terms
- a(0) =1a(1) =2a(2) =1a(3) =3a(4) =2a(5) =1a(6) =4a(7) =4a(8) =2a(9) =1a(10) =5a(11) =8a(12) =8a(13) =2a(14) =1a(15) =6a(16) =16a(17) =32a(18) =22a(19) =2a(20) =1a(21) =7a(22) =32a(23) =128a(24) =170a(25) =72a(26) =2a(27) =1a(28) =8a(29) =64
External references
- oeis: A361043