59640
domain: N
Appears in sequences
- Sum of the first n even squares: a(n) = 2*n*(n+1)*(2*n+1)/3.at n=35A002492
- Binomial coefficient C(6n,n-9).at n=3A004364
- Binomial coefficient C(8n,n-6).at n=3A004387
- Dodecahedral numbers: a(n) = n*(3*n - 1)*(3*n - 2)/2.at n=24A006566
- Binomial coefficients C(n,69).at n=3A017733
- Binomial coefficients C(72,n).at n=3A017788
- (prime(n)-5)(prime(n)-7)(prime(n)-9)/48.at n=32A030002
- Triangle read by rows: T(n, k) = [x^k] x*Pochhammer(n + x, n)/(n + x).at n=32A038455
- Binomial(sigma(n),omega(n)), where sigma(n) is the sum of divisors of n (A000203) and omega the number of distinct prime factors (A001221).at n=29A068905
- Smallest number having exactly n divisors that are not greater than the number's greatest prime factor.at n=23A087134
- 1/6 of product of three numbers: n-th prime, previous and following number.at n=19A127920
- a(n) = floor(n^(3/2))*floor(1 + n^(3/2))*floor(2 + n^(3/2))/6.at n=16A185592
- Molecular topological indices of the sunlet graphs.at n=29A192846
- Quarter-square tetrahedrals: a(n) = k*(k - 1)*(k - 2)/6, k = A002620(n).at n=17A217482
- Numbers n such that {largest m such that 1, 2, ..., m divide n} is different from {largest m such that m! divides n^2}.at n=36A232099
- Numbers k such that 11^phi(k) == 1 (mod k^2), where phi(k) = A000010(k).at n=25A253016
- Smallest tetrahedral number with exactly n divisors, or 0 if no such number exists.at n=63A279082
- a(n) = (5*n + 5)*(5*n + 6)*(5*n + 7)/6.at n=13A300523
- Triangle read by rows: T(n,k) = binomial(n*k,3) (0 <= k <= n).at n=53A334703
- Primorial deflation of the n-th colossally abundant number: the unique integer k such that A108951(k) = A004490(n).at n=31A342012