Total sum T(n,k) of number of lambda-parking functions of partitions lambda of n into distinct parts with largest part k; triangle T(n,k), k>=0, k<=n<=k*(k+1)/2, read by columns.
A265019
Total sum T(n,k) of number of lambda-parking functions of partitions lambda of n into distinct parts with largest part k; triangle T(n,k), k>=0, k<=n<=k*(k+1)/2, read by columns.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =3a(4) =3a(5) =5a(6) =8a(7) =16a(8) =4a(9) =7a(10) =12a(11) =40a(12) =34a(13) =50a(14) =125a(15) =5a(16) =9a(17) =16a(18) =55a(19) =73a(20) =132a(21) =281a(22) =351a(23) =307a(24) =432a(25) =1296a(26) =6a(27) =11a(28) =20a(29) =70
External references
- oeis: A265019