30239

Appears in sequences

• Number of permutations of (1,...,n) having n-2 inversions (n>=2).at n=9A001892
• a(n) is least N > 1 congruent to -1,0, or 1 mod i for all i=1,...,n.at n=15A056697
• Pseudo-random numbers: Davenport's generator for 32-bit integers.at n=33A084277
• Numbers n where either n or n+1 is divisible by the numbers from 1 to 12.at n=8A131662
• Number of "ON" cells at n-th stage of three-dimensional version of the cellular automaton A160414 using cubes.at n=18A161340
• Number of reduced words of length n in the Weyl group A_10.at n=9A161458
• Numbers m such that m mod k is k-1 for all k = 2..9.at n=11A166931
• a(n) = 6*n! - 1.at n=7A173316
• Sums of pairs of betrothed (or quasi-amicable) numbers.at n=7A179612
• Smallest number requiring n terms to be expressed as a sum of factorials.at n=26A200748
• The least number having n representations as p*q - p - q for primes p <= q.at n=11A218862
• a(n) = smallest m such that A187824(m) = n, or -1 if A187824 never takes the value n.at n=16A220890
• Where record values occur in A187824.at n=10A220891
• Smallest number m such that A226460(m) = n.at n=27A226462
• 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=25A230429
• Square array A(n,k) = A276945(n,k)-1, read by descending antidiagonals: A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), etc.at n=40A286615
• Transpose of square array A286615.at n=40A286616
• Number of integer partitions of n whose omega-sequence has repeated parts.at n=39A325285
• a(n) = Sum_{k=1..n} mu(k) * k^n.at n=5A344429