Number of steps required for a certain algorithm for producing all permutations of n letters.
A135848
Number of steps required for a certain algorithm for producing all permutations of n letters.
Terms
- a(0) =40a(1) =154a(2) =638a(3) =3194a(4) =19130a(5) =133836a(6) =1070550a(7) =9634750a(8) =96347210a(9) =1059818936a(10) =12717826742
External references
- oeis: A135848