32736
domain: N
Appears in sequences
- Orders of noncyclic simple groups (without repetition).at n=22A001034
- a(n) = (5*n + 1)*(5*n + 2)*(5*n + 3).at n=6A001509
- a(n) = floor(Fibonacci(n)/6).at n=27A004699
- a(n) = floor(n*phi^15), where phi is the golden ratio, A001622.at n=24A004930
- a(n) = round(n*phi^15), where phi is the golden ratio, A001622.at n=24A004950
- a(n) = n*(n-1)*(n-2) (or n!/(n-3)!).at n=33A007531
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/30).at n=33A011940
- Numbers j such that sigma(sigma(j)) = k*j for some k.at n=30A019278
- Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (2,10)-perfect numbers.at n=4A019287
- a(n) = lcm(n,n+1,n+2).at n=30A033931
- Denominator of b(n)-b(n+1), where b(n) = n/((n+1)(n+2)) = A026741/A045896.at n=29A051713
- Number of ordered pairs of complementary subsets of an n-set with both subsets of cardinality at least 2.at n=15A052515
- a(n) = 3*n*(3*n-1)*(3*n-2).at n=11A054776
- Jacobi form of weight 12 and index 1 associated to a (nonexistent) lattice vector of norm 2 for the Leech lattice.at n=7A056945
- a(n) is the number of distinct patterns (modulo geometric D3-operations) with strict median-reflective (palindrome) symmetry (i.e., having no other symmetry) which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.at n=28A060549
- a(n) is the number of distinct patterns (modulo geometric D3-operations) with strict median-reflective (palindrome) symmetry (i.e., having no other symmetry) which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.at n=29A060549
- a(n) = lcm(3n+1, 3n+2, 3n+3).at n=10A061495
- Numbers n such that n and 2^n end with the same three digits.at n=32A067866
- a(n) = (2n+1)*(2n+2)*(2n+3).at n=15A069072
- a(n) = (4*n-1)*4*n*(4*n+1).at n=8A069140