2310000

Appears in sequences

• a(n) is (n+1)!*(n+2)! times coefficient of x^n in (log(1-x))^-1.at n=6A009763
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= n/3.at n=31A047200
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= (n-1)/3.at n=31A048012
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= (n-2)/3.at n=31A048023
• Numbers k such that 2k+1, 4k+1, 6k+1, 8k+1, 10k+1 and 12k+1 are primes.at n=7A124411
• Numbers m that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (m raised to k+1 must not be a multiple). Case k=16.at n=16A135201
• a(n) = C(2n,n) * (5^n/n!^2) * Product_{k=0..n-1} (5k+1)*(5k+4).at n=3A184892
• T(n,k) is the number of size k ordered submultisets of the regular multiset {1_1,1_2,...,1_(n-1),1_n, ... ,i_1,i_2,...,i_(n-1),i_n, ... ,n_1,n_2,...,n_(n-1),n_n} (which contains n copies of i for 1 <= i <= n).at n=29A234574
• Triangle read by rows: T(m,n) = number of ways of distributing n distinguishable balls into m distinguishable bins of size 4 where empty bins are permitted (m >= 1, 1 <= n <= 4m).at n=34A248846