34407

Appears in sequences

• a(n) = n! - Sum_{j=1..n-1} j!.at n=7A132371
• Triangle read by rows: T(n,k) is the number of deco polyominoes of height n in which the maximal number of initial consecutive columns ending at the same level is k (1 <= k <= n).at n=28A140709
• Number of Proth primes < 2^n.at n=35A214120
• Number of Motzkin paths of length n with no level steps at height 3.at n=13A257386
• p-INVERT of (1,0,0,1,0,0,1,0,0,...), where p(S) = 1 - S^2 - S^3.at n=22A292321
• Triangle read by rows: T(m,n) is the label of the largest square that an (m,n)-leaper (a generalization of a chess knight) reaches before it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square.at n=10A306197