80864

Appears in sequences

• Number of derangements of n where minimal cycle size is at least 3.at n=9A038205
• Gaps of 8 in sequence A038593 (upper terms).at n=30A038656
• Triangle read by rows: T(n,k) is the number of derangements of {1,2,...,n} having k cycles of length 2 (0 <= k <= floor(n/2)).at n=25A162974
• Number of (w,x,y,z) with all terms in {1,...,n} and |x-y|=|y-z|.at n=38A212679
• Triangle read by rows: T(n,k) is the number of permutations in S_n for which all cycles are length k or greater.at n=38A333726
• Triangle read by rows: T(n,k) is the number of permutations of length n that have k same elements at the same positions with its inverse permutation for 0 <= k <= n.at n=45A344901
• Number of integer points (x, y, z, w) at distance <= 1/2 from 3-sphere of radius n.at n=16A350740
• Triangle read by rows: T(n,k) is the number of derangements in S_n with no k-cycles. 1 <= k <= n.at n=37A378495
• a(n) = the smallest positive integer that produces a product that contains the digit 2 when multiplied by 2 at most n times, and where a further multiplication by 2 produces a number that does not contain the digit 2. Set a(n) = -1 if no such number exists.at n=21A381183