29055

Appears in sequences

• Number of partitions of n into parts not of the form 23k, 23k+11 or 23k-11. Also number of partitions with at most 10 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=40A035999
• Moebius transform of binomial(n+3, 4).at n=27A117109
• a(n) = (2*n^3 + 5*n^2 - 13*n)/2.at n=29A162262
• Irregular triangle read by rows: T(n,k) is the k-th generalized Eulerian number of order n and degree 2, for n >= 1 (the rows start at k=1).at n=42A211232
• Number of nX5 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nX5 array.at n=3A220007
• T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nXk array.at n=31A220010
• Number of 4Xn arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 4Xn array.at n=4A220013
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 283", based on the 5-celled von Neumann neighborhood.at n=15A280530
• Numbers m for which the sum of all values of k satisfying the equation: (m - floor((m - k)/k)) mod k = 0 (1 <= k <= m) equals 2*m.at n=2A380153