43890
domain: N
Appears in sequences
- From the enumeration of corners.at n=9A006332
- Orders of non-cyclic simple groups (divided by 4).at n=34A008976
- Theta series of A_21 lattice.at n=2A023912
- a(n) = n*(n+1)*(n+2)*(n+3)/4.at n=19A033487
- (Largest) diagonal of the Zorach additive triangle A035312.at n=12A035313
- The convolution matrix of the double factorial of odd numbers (A001147).at n=32A035342
- Fifth column of triangle A035342; related to A035330.at n=7A035521
- Triangle read by rows in which row n contains first n numbers with exactly n distinct prime factors.at n=17A048692
- GCD of divisor-sum of primorials and primorials itself: a(n) = gcd(A002110(n), A000203(A002110(n))).at n=13A054641
- GCD of divisor-sum of primorials and primorials itself: a(n) = gcd(A002110(n), A000203(A002110(n))).at n=16A054641
- GCD of divisor-sum of primorials and primorials itself: a(n) = gcd(A002110(n), A000203(A002110(n))).at n=15A054641
- GCD of divisor-sum of primorials and primorials itself: a(n) = gcd(A002110(n), A000203(A002110(n))).at n=14A054641
- Distinct values of GCD of divisor sum of primorials and primorial itself: gcd(A002110(n), A000203(A002110(n))).at n=5A054642
- Triangle T(n,k) = binomial(n+2,k+1)*(binomial(n+2,k+1)-1), n >=0, 0 <= k <= n.at n=41A065420
- Triangle T(n,k) = binomial(n+2,k+1)*(binomial(n+2,k+1)-1), n >=0, 0 <= k <= n.at n=39A065420
- Numbers k such that phi(k) < k/5.at n=2A066765
- Products of exactly 6 distinct primes.at n=2A067885
- a(n) = n*(16*n^2 - 1).at n=13A069975
- Number of two-rowed partitions of length 4.at n=37A070557
- Integers which have more than one coprime factorization into nonprime powers which sum to the same number.at n=1A072940