524160

Appears in sequences

• Triangle of D'Arcais numbers.at n=36A008298
• Expansion of e.g.f.: tanh(log(1+x))*log(1+x).at n=10A009779
• a(n) = (n-1)! * sigma(n).at n=8A038048
• Expansion of e.g.f.: (1-x)/(1 - x - x^2).at n=8A052554
• Expansion of e.g.f. 1/(1-x-x^3).at n=8A052556
• Expansion of e.g.f. (1 - x - sqrt(1-2*x+x^2-4*x^3))/(2*x).at n=8A052723
• A simple context-free grammar in a labeled universe: a(n) = A052743(n)-A052723(n), n>1.at n=8A052724
• Product of 5 consecutive integers.at n=16A052787
• E.g.f.: x^5*exp(x)-x^5.at n=16A052800
• Largest number of binary size n (i.e., between (n-1)-th and n-th powers of 2) with the following property: cube of its number of divisors is larger than the number itself.at n=18A056767
• A hierarchical sequence (S(W'2{3}c) - see A059126).at n=5A059155
• 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=36A060549
• a(1) = 1; a(n) > 0; for each k from 1 to n, k divides a(n) or a(n)+1 and a(n) is the least such integer.at n=17A064219
• a(1) = 1; a(n) > 0; for each k from 1 to n, k divides a(n) or a(n)+1 and a(n) is the least such integer.at n=16A064219
• Triangle T(n,k) defined by Sum_{1<=k<=n} T(n,k)*u^k*t^n/n! = exp(((1-t)*(1-t^2)*(1-t^3)...)^(-u)-1).at n=36A066045
• The sum of the non-divisors of n (less than n) is a multiple of the sum of the divisors of n.at n=36A066860
• Triangle T(n,k) defined by Sum_{k=1..n} T(n,k)*u^k*t^n/n! = ((1+t)*(1+t^2)*(1+t^3)...)^u.at n=36A075525
• Numbers k such that sum of the divisors d of k divides 1 + 2 + ... + k = k(k+1)/2.at n=38A076617
• Triangle whose n-th row contains the n smallest numbers that are products of n distinct integers > 1, read by rows.at n=35A081957
• Diagonal of A081957.at n=7A081958