56000

Appears in sequences

• Triangle of coefficients in expansion of (1+10x)^n.at n=39A013617
• Third binomial transform of Fib(3n-3) divided by 2.at n=7A093133
• Consider the family of multigraphs enriched by the species of parts. Sequence gives number of those multigraphs with n labeled edges.at n=5A098628
• If n <= 1 then n else smallest number having in decimal representation exactly one common digit with its predecessor but none with its pre-predecessor.at n=50A107277
• Numbers k such that k and k^2 use only the digits 0, 1, 3, 5 and 6.at n=30A136843
• Numbers with prime factorization pq^3r^6.at n=12A190467
• Numbers having factorization Product_{i=1..m} p(i)^e(i) such that m > 1 and p(i) + e(i) is the same for each i.at n=21A219302
• Number of partitions of the 8-dimensional hypercube resulting from a sequence of n bisections, each of which splits any part perpendicular to any of the axes.at n=4A237023
• a(n) = 7*n^3.at n=20A244727
• Expansion of Product_{k>=1} (1 + x^(3*k-1))^(3*k-1).at n=40A262948
• Triangle read by rows: denominators of c_{n,k}, n >= 0, k = 0..n, used in the proof that Zeta(3) is irrational.at n=22A303989
• a(n) = n^3 if n odd, 7*n^3/8 if n even.at n=40A309335
• Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 10 * T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.at n=39A317054
• Expansion of e.g.f. exp(x^3/3)/(1 - x).at n=8A319364
• Expansion of Product_{i>=1, j>=1} (1 + x^(i*j)) * (1 + x^(2*i*j)).at n=25A329467
• Table read by rows: T(n,k) = number of k-gons, k >= 3, formed inside a square with edge length 1 by the straight line segments mutually connecting all vertices and points that divide the sides into segments with lengths equal to the Farey series of order n = A006842(n,m)/A006843(n,m), m = 1..A005728(n).at n=15A358889
• a(n) is the sum of the divisors of n*2^n + 1.at n=12A367010
• Triangle read by rows, T(n, k) = [x^k] p(n), where p(n) = 4^n * hypergeom([1/2, -n - 1, -n], [2, 2], x).at n=24A367022
• Number of maximal subsets of {1..n} such that it is possible to choose a different prime factor of each element.at n=36A370585
• Number of maximal subsets of {1..n} such that it is possible to choose a different prime factor of each element.at n=37A370585