47250

Appears in sequences

• Multiplicative encoding of Pascal triangle: Product p(i+1)^C(n,i).at n=3A007188
• Area of more than one Pythagorean triangle.at n=35A009127
• a(n) = 225*(n-1)*(n-2)/2.at n=19A027470
• Triangle of labeled mobiles (circular rooted trees) with n nodes and k leaves.at n=24A055349
• Number of labeled mobiles (circular rooted trees) with n nodes and 4 leaves.at n=2A055351
• Triangle read by rows: T(n,k) = T(n-1,k-1)*T(n,k-1) and T(n,1) = prime(n).at n=9A066117
• a(n) = 15n^2 + 13n^3.at n=15A085377
• a(n) = n^4 - n^3.at n=15A085537
• a(n) = n*(n + 1)^3.at n=14A085540
• Numbers whose set of base 15 digits is {0,E}, where E base 15 = 14 base 10.at n=8A097261
• Numbers n such that the sum of the digits of phi(n)^sigma(n) is divisible by n.at n=20A109668
• Triangle T(n,k) = number of permutations of n elements with k 2-cycles.at n=33A114320
• Product_{i=3..n} |Stirling_1(i,3)|.at n=3A126676
• Numbers that appear exactly five times in A101402. (Also indices of fives in A101403.).at n=32A129117
• A certain partition array in Abramowitz-Stegun order (A-St order), called M_3(5).at n=38A134273
• Triangular array read by rows: e.g.f. sqrt(1-z^2)*exp(x*z)/(1+z).at n=59A138022
• a(n) = 2*a(n-1) - a(n-2) + 2*a(n-3) - a(n-4) + a(n-5), n > 5.at n=19A152718
• Numbers with prime factorization p*q*r^3*s^3 (where p, q, r, s are distinct primes).at n=25A190108
• Triangle read by rows: T(n,k) = (n-1-k)*abs(s(n,n+1-k)), where s(n,k) are the signed Stirling numbers of the first kind and 1 <= k <= n.at n=48A199220
• Number of (w,x,y,z) with all terms in {0,...,n}, w, x and y odd, and z odd.at n=28A212764