15925248

Appears in sequences

• Square array a(n,k) read by antidiagonals: a(n,1)=n, a(1,k)=k, a(n,k) = a(n-1,k-1)*a(n-1,k)*a(n,k-1).at n=17A047675
• Square array a(n,k) read by antidiagonals: a(n,1)=n, a(1,k)=k, a(n,k) = a(n-1,k-1)*a(n-1,k)*a(n,k-1).at n=18A047675
• Row 3 of square array defined in A047675.at n=3A047678
• a(n) = gcd(Phi(n!), Phi(n^n), Phi(lcm(1..n))).at n=23A064449
• 3 people at a party are saying Hello to each other. Person 1 says Hello. Person 2 counts the times Hello has been said and says Hello twice that number. Person 3 says Hello 3 times the sum of Hello's and then it is Person 1 again. This is how many Hello's each person says.at n=16A076505
• Expansion of 2*x*(1+4*x+8*x^2)/(1-24*x^3).at n=15A076508
• Number of divisors of the n-th superior highly composite number.at n=32A098895
• Largest order of a solvable subgroup of the symmetric group S_n.at n=16A099732
• Number of labeled marked rooted trees with n nodes.at n=5A136796
• a(n) = 2*(2*n+2)^floor((n-1)/2).at n=11A152556
• Number of ways to assemble an n-simplex from n+1 labeled (n-1)-simplices with labeled vertices, where left-handed and right-handed counterparts are considered distinct.at n=3A165644
• Rolling cube footprints: number of nX7 0..5 arrays starting with 0 where 0..5 label faces of a cube and every array movement to a horizontal or antidiagonal neighbor moves across a corresponding cube edge.at n=1A223356
• T(n,k)=Rolling cube face footprints: number of nXk 0..5 arrays starting with 0 where 0..5 label faces of a cube and every array movement to a horizontal or antidiagonal neighbor moves across a corresponding cube edge.at n=29A223357
• Number of length n+5 0..2 arrays with no six consecutive terms having two times the sum of any two elements equal to the sum of the remaining four.at n=15A249227
• a(n) = 16^n * n * (n!)^4.at n=3A280845
• a(n) = n^5*H(n) where H() is the Hurwitz class number.at n=24A297122
• Number of subsets of {2...n} containing no element whose prime indices all belong to the subset.at n=28A324739
• Number of even divisors of n!.at n=35A337257
• The least number of the form 2^i*3^j (i, j >= 0) which can be represented as a product of the greatest number of distinct positive integers in exactly n ways.at n=20A338261