129766
domain: N
Appears in sequences
- Dodecahedral numbers: a(n) = n*(3*n - 1)*(3*n - 2)/2.at n=31A006566
- Binomial coefficients C(n,90).at n=3A017754
- Binomial coefficients C(93,n).at n=3A017809
- (prime(n)-5)(prime(n)-7)(prime(n)-9)/48.at n=40A030002
- Squarefree tetrahedral numbers.at n=27A070755
- G.f. A(x) satisfies A097182(x*A(x)) = A(x) and so equals the ratio of the g.f.s of any two adjacent diagonals of triangle A097181.at n=5A097184
- Tetrahedral numbers n*(n+1)*(n+2)/6 with n, n+1 and n+2 nonprime.at n=29A152622
- The number of inequivalent ways to color the vertices of a regular octahedron using at most n colors.at n=12A198833
- Number of nX2 0..3 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X3 0..3 array without adjacent equal elements in the latter.at n=4A229315
- Number of nX5 0..3 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X6 0..3 array without adjacent equal elements in the latter.at n=1A229318
- T(n,k)=Number of nXk 0..3 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X(k+1) 0..3 array without adjacent equal elements in the latter.at n=16A229320
- T(n,k)=Number of nXk 0..3 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X(k+1) 0..3 array without adjacent equal elements in the latter.at n=19A229320
- a(n) = (32*n^3 - 2*n)/3.at n=23A267031
- Tetrahedral numbers that are not divisible by any smaller tetrahedral number except 1.at n=23A318701
- a(n) = A000292(6*n + 1) where A000292 are the tetrahedral numbers.at n=15A349682
- Squarefree tetrahedral numbers which are products of five distinct primes.at n=4A354976
- a(n) is the smallest tetrahedral number with binary weight n.at n=12A359317
- G.f. A(x) satisfies A(x) = (1 + x / (1 - x*A(x))^2)^2.at n=9A365120