|
Search: id:A028498
|
|
|
| A028498 |
|
Let [ n ] = {0,...,n-1}; a(n) is number of functions f:[ n ]->[ n ] for which there exists an injection g:[ n ]->[ n+1 ] such that for j with 0 <= j < n, either g(j)= f(j) or g(j)= f(j)+1. |
|
+0
1
|
|
| 1, 4, 24, 186, 1770, 19980, 260820, 3863160, 63980280, 1171195200, 23476068000, 511296786000, 12021166357200, 303414507396000, 8182057223340000
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
