105105

Appears in sequences

• Number of n-step mappings with 4 inputs.at n=33A005945
• a(n) = 5*(n+1)*binomial(n+2, 5)/2.at n=10A027778
• a(n) = 11*(n+1)*binomial(n+2,11)/2.at n=4A027784
• Expansion of 1/((1-2x)(1-7x)(1-8x)(1-11x)).at n=4A028007
• Lucky numbers that are concatenations of a number k with itself.at n=12A032650
• a(n) = (2*n+1)*(3*n+1)*(4*n+1).at n=16A033591
• a(1)=10; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^e_i * Product p_{i+3}^e_i.at n=29A045973
• Numbers k such that usigma(k) = phi(k)*omega(k), where omega(k) is the number of distinct prime divisors of k.at n=29A063795
• Boundaries of primorial intervals [1,3]; [3,9],[9,15]; [15,45], etc.at n=20A065917
• a(n) = n*(n+1)^2*(2+n)*(3+2*n)*(19+8*n)/180.at n=9A076758
• Numbers with exactly 5 distinct odd prime divisors {3,5,7,11,13}.at n=3A147578
• Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m).at n=31A155495
• Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m).at n=32A155495
• Numbers k such that the sum of the distinct prime divisors of k equals three times the largest prime divisor of k.at n=7A200090
• Numbers k such that 6*3^k + 1 is prime.at n=32A216888
• Triangle read by rows, the coefficients of J. L. Fields generalized Bernoulli polynomials.at n=34A220412
• 3n concatenated with itself.at n=34A248038
• Irregular triangle read by rows in which the n-th row lists multinomials (A036040) for partitions of 2n which have only even parts in Abramowitz-Stegun ordering.at n=36A257490
• Odd non-coreful abundant numbers: the odd terms of A308127.at n=36A339938
• a(n) is the smallest number that has exactly n odious divisors (A000069).at n=22A355968