Irregular table read by rows, T(n, k) is the rank of the k-th Genocchi permutation of {1,...,n}, permutations sorted in lexicographical order. If no Genocchi permutation of {1,...,n} exists, then T(n, 1) = 0 by convention.
A347599
Irregular table read by rows, T(n, k) is the rank of the k-th Genocchi permutation of {1,...,n}, permutations sorted in lexicographical order. If no Genocchi permutation of {1,...,n} exists, then T(n, 1) = 0 by convention.
Terms
- a(0) =1a(1) =0a(2) =5a(3) =0a(4) =67a(5) =91a(6) =92a(7) =0a(8) =1897a(9) =2017a(10) =2018a(11) =2617a(12) =2619a(13) =2737a(14) =2738a(15) =2739a(16) =2740a(17) =3457a(18) =3458a(19) =3459a(20) =3460a(21) =4177a(22) =4178a(23) =4179a(24) =4180a(25) =0a(26) =99241a(27) =99961a(28) =99962a(29) =104281
External references
- oeis: A347599