2646000

Appears in sequences

• Numbers k such that sigma(k) - usigma(k) > 3k.at n=11A063875
• Triangle read by rows: T(n,h) = number of functions f:{1,2,...,n}->{1,2,...,n-1} such that |Image(f)|=h, h=1,2,...,n-1, n=2,3,...at n=25A101819
• Triangle read by rows: T(n,h) = number of functions f:{1,2,...,n}->{1,2,...,n-2} such that |Image(f)|=h, h=1,2,...,n-2; n=3,4,....at n=19A101821
• Number of (n+2) X 3 binary arrays avoiding patterns 001 and 011 in rows and columns.at n=24A202093
• Number of (n+1)X(2+1) 0..1 arrays with nondecreasing sum of every two consecutive values in every row and column.at n=25A250426
• a(n) = A278222(n^3).at n=39A286375
• Triangle read by rows: T(n,k) (n>=1, 4<=k<=n+3) is the number of k-sequences of balls colored with at most n colors such that exactly three balls are of a color seen previously in the sequence.at n=25A292879
• Expansion of 60*x*(1 + 4*x + x^2) / (1 - x)^5.at n=19A316458
• Numbers k such that k and the next two numbers after k with the same prime signature as k also have the same set of distinct prime divisors as k.at n=19A340303
• Numbers k such that k and the next three numbers after k with the same prime signature as k also have the same set of distinct prime divisors as k.at n=2A340304
• Numbers k such that k | A328258(k).at n=8A348584
• a(n) is the smallest number k with exactly n of its divisors in A037197.at n=28A362139
• Numbers of least prime signature (A025487) whose prime factorization has equal sum of even and odd exponents.at n=10A371600
• a(n) is the least exponential deficient number that has exactly n exponential abundant divisors.at n=19A389300