80638
domain: N
Appears in sequences
- Triangle T(n, k) = k*(n-1)! - k!, read by rows.at n=37A137260
- Number of ways to place 4 nonattacking nightriders on a 4 X n board.at n=11A172219
- Triangle T(n,k) giving the largest member of "the infinite trunk of factorial beanstalk" (A219666) whose factorial base representation contains n digits (A084558) and the most significant such digit (A099563) is k.at n=28A230429
- Numbers k such that (302*10^k + 13)/9 is prime.at n=23A281144