43010

Appears in sequences

• a(0) = 1, a(n) = 42*n^2 + 2 for n>0.at n=32A010023
• a(n) = Product_{k=1..n} prime(2k-1), where prime(k) is k-th prime.at n=4A066205
• Numerators of coefficients in (1+x)^(1/3)-(1-x)^(1/3) power series.at n=4A068561
• a(0) = 1, a(1) = 2; for n > 1, a(n) = prime(n)*a(n-2).at n=9A079078
• n*(n-1)*(n^2-n+4)/6.at n=23A103290
• a(n) is the smallest even number m having n distinct odd prime divisors p_1, p_2, ..., p_n, each of which (p_i; i=1..n) has the property that there exists a k_i (0 < k_i < p_i-1) such that p_i - k_i | m - k_i.at n=3A309781
• a(n) = Product_{d|n, d<n} prime(1+A001414(d)), where A001414(d) gives the sum of prime factors of d, with repetition.at n=31A319692
• a(n) is the number of ways to split [n] = {1,2,...,n} into two (possibly empty) complementary intervals {1,2,...,i} and {i+1,i+2,...,n} and then, if both intervals are nonempty, select 2 nonempty blocks/cells (i.e., subintervals) from each of them, or if one of the intervals is empty, select 2 nonempty blocks/cells from the nonempty interval.at n=22A353232
• Position in A356226 of first appearance of the n-th composition in standard order (row n of A066099).at n=31A356603