22330

Appears in sequences

• Number of partitions of floor(5n/2) into n nonnegative integers each no more than 5.at n=43A001975
• Octagonal pyramidal numbers: a(n) = n*(n+1)*(2*n-1)/2.at n=27A002414
• Table read by rows giving the coefficients of general sum formulas of n-th sums of Bell numbers (A005001). The k-th row (k>=1) contains T(i,k) for i=1 to 2*k and k=1 to n-3, where T(i,k) satisfies Sum_{q=1..n} Bell(q) = 1 + C(n,2) + Sum_{k=1..n-3} Sum_{i=1..2*k} T(i,k) * C(n-k-2,1).at n=27A102735
• Sum of the odd parts in all partitions of n into distinct parts.at n=40A116682
• Sum of coefficients of polynomials defined in comments lines.at n=13A129891
• a(n) = core(A143176(n)).at n=28A144362
• Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^3 = I.at n=3A162831
• Numbers n such that n^2 can be represented as sum of (at least two) consecutive cubes and n is not a triangular number.at n=28A163393
• Numbers n such that 6n and 12n are both the average of twin prime pairs.at n=32A177680
• Even octagonal pyramidal numbers (A002414).at n=13A218327
• The least k such that the polynomial cyclotomic(k,x) has n different coefficients.at n=24A231611
• The stonemason's problem: numbers n such that n^2 is the sum of more than three consecutive cubes, the cube 1 being disallowed.at n=29A238099
• G.f.: (1-x+sqrt(1-2*x-3*x^2))/(1-3*x+x^2+x^3+(1-x^2)*sqrt(1-2*x-3*x^2)).at n=12A244886
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 597", based on the 5-celled von Neumann neighborhood.at n=27A273146
• Number of 2 X n 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=10A281766
• a(n) = (1/2)*A293077(n).at n=19A293078
• Number of n X n 0..1 arrays with every element equal to 1, 2 or 4 king-move adjacent elements, with upper left element zero.at n=19A297851
• Number of n X 4 0..1 arrays with every element equal to 0, 1, 2, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=7A299093
• a(n) = n*(n + 1)*(16*n - 1)/6.at n=20A304659
• Squarefree numbers k such that the sum of the distinct prime factors of k is twice the difference between the largest and the smallest prime factors of k.at n=24A324210