48320

Appears in sequences

• Numbers k such that k and k^2 have the same set of digits.at n=22A029793
• Triangle T, read by rows, equal to the matrix square of triangle A113106, which satisfies the recurrence: A113106(n,k) = [A113106^5](n-1,k-1) + [A113106^5](n-1,k).at n=11A113108
• Numbers k such that k and k^2 use only the digits 0, 2, 3, 4 and 8.at n=38A136885
• Triangle read by rows: T(n, k) = binomial(n-1, k-1)*A008292(n, k).at n=24A141686
• Monotonic ordering of set S generated by these rules: if x and y are in S and x^2 - y^2 > 0 then x^2 - y^2 is in S, and 1 and 3 are in S.at n=12A192647
• Number of nX4 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and no element equal to any horizontal or vertical neighbor.at n=6A199129
• Number of nX7 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and no element equal to any horizontal or vertical neighbor.at n=3A199132
• T(n,k)=Number of nXk 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and no element equal to any horizontal or vertical neighbor.at n=48A199133
• T(n,k)=Number of nXk 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and no element equal to any horizontal or vertical neighbor.at n=51A199133
• Number of functions on n unlabeled nodes in which all the components are distinct.at n=12A217861
• G.f.: Sum_{n>=0} R_n(x+x*y) * x^(2*n)*y^n / (1-x-x*y)^(4*n+1) = Sum_{n>=0} Sum_{k=0..n} C(n,k)^4 * x^n*y^k, where R_n(x+x*y) equals the n-th row polynomial R_n(z) = Sum_{k=0..2*n} T(n,k)*z^k at z = x+x*y.at n=12A248600
• Central terms of triangle A248600.at n=3A248706
• 8-step Fibonacci sequence starting with 0,1,0,0,0,0,0,0.at n=24A251745
• Irregular triangle read by rows. T(n,k) is the number of properly colored simple labeled graphs on [n] with exactly k edges, n >= 0, 0 <= k <= binomial(n,2).at n=21A361456
• a(n) = coefficient of sqrt(3) in the expansion of (3 + sqrt(2) + sqrt(3))^n.at n=7A377115