53240

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j)*11^j.at n=18A038217
• Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*11^j.at n=13A038313
• Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*2^j.at n=17A038316
• Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)*10^j.at n=11A038324
• Composite numbers divisible by the palindromic sum of their palindromic prime factors (counted with multiplicity).at n=27A046366
• a(n) = ((n-th prime)^5-(n-th prime)^3)/3.at n=4A138433
• Wiener index of the grid P_n x P_n, where P_n is the path graph on n vertices.at n=10A143945
• a(n) = 4*(n^4-n^3).at n=10A160538
• Central coefficient of the triangle A097609.at n=10A212696
• Numbers k such that the sum of prime factors of k (counted with multiplicity) equals four times the largest prime divisor of k.at n=34A212862
• Number of rooted binary MUL-trees with n leaves on the label set [4].at n=6A220817
• a(n) = 5*n^3.at n=22A244725
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 443", based on the 5-celled von Neumann neighborhood.at n=30A288334
• a(n) = Sum_{k=1..n^2, gcd(n,k) = 1} k.at n=21A308474
• Array read by antidiagonals: T(n,k) is the number of binary rooted trees with n leaves of k colors and all non-leaf nodes having out-degree 2.at n=51A319539
• Table T(n,k) = phi(phi(prime(n)^k)), n >= 1, k >= 0, read by upwards antidiagonals, where phi = A000010.at n=50A380500