42048

Appears in sequences

• Expansion of Product_{m>=1} (1+x^m)^3.at n=23A022568
• Numbers which can be written as b^2*c^2*(b^2+c^2).at n=33A063663
• Triangle read by rows giving coefficients of polynomials arising in successive differences of (n!)_{n>=0}.at n=43A094791
• Triangle T(n, k) = (f(n, 1 + (n mod 3)) + f(k, 1 + (k mod 3))) mod n!, read by rows (see formula for f(n, k)).at n=53A117754
• a(n) = 73*n^2.at n=24A174334
• The first of three triangles counting 3-colored alternating permutations by their last value.at n=25A202692
• Array a(n,m) = ((n+2)/2)^m*Sum_{k=1..n+1} 1/sin(k*Pi/(n+2))^(2m), n>=0, k>=0, read by ascending antidiagonals.at n=48A247239
• Triangle read by rows, T(n,k) = Sum_{j=0..n} C(-j,-n)*S1(j,k), S1 the Stirling cycle numbers A132393, for n>=0 and 0<=k<=n.at n=47A269954
• a(n) = 3*n^3 + n^2.at n=24A294315
• Expansion of e.g.f. -exp(-x)*log(1 - x)/(1 - x).at n=8A300490
• O.g.f. A(x) satisfies: A(x) = x*(1 - 2*x*A'(x)) / (1 - 3*x*A'(x)).at n=6A300987
• Number of subsets of {1...n} containing no element > 1 whose prime indices all belong to the subset.at n=19A324738
• Primitive numbers that are the sum of the squares of two of their distinct divisors.at n=21A338485
• a(n) is the number of large or small squares that are used to tile primitive squares of type 1 whose length of side is A344333(n).at n=19A344334
• a(n) = Sum_{k=1..n} (-1)^(k+1) * floor(n/k)^3.at n=35A344721
• a(n) is the number of large or small squares that are used to tile primary squares of type 1 (see A344331) whose side length is A345285(n).at n=24A345286
• Irregular table read by rows: T(n,k) is the number of k-gons, k>=3, formed in a square with edge length 1 by straight line segments when connecting the internal edge points that divide the sides into segments with lengths equal to the Farey series of order n to the equivalent points on the opposite side of the square.at n=19A359656
• a(n) is the number of n-digit numbers that contain '22' in their decimal representation.at n=6A365137