28992

Appears in sequences

• a(n) = Sum_{k=1..n} floor((n/k) * floor((n/k) * floor(n/k))).at n=28A024922
• Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 85.at n=34A031583
• A variant of the recurrence for A001190.at n=18A038750
• Number of 3 X n checkerboards (with at least one red square) in which the set of red squares is edge-connected.at n=6A059021
• Number of permutations p of 1,2,...,n satisfying |p(i+5)-p(i)|<>5 for all 1<=i<=n-5.at n=7A189256
• Number of ways to place n nonattacking composite pieces rook + rider[5,5] on an n X n chessboard.at n=7A189841
• Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) is not a part of p.at n=41A241736
• Number of (n+2) X (4+2) 0..3 arrays with every 3 X 3 subblock row and column sum equal to 0 2 3 6 or 7 and every 3 X 3 diagonal and antidiagonal sum not equal to 0 2 3 6 or 7.at n=10A252110
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 542", based on the 5-celled von Neumann neighborhood.at n=43A272811
• Array read by antidiagonals: T(m,n) = number of nonzero m X n binary arrays with all 1's connected.at n=30A287151
• Array read by antidiagonals: T(m,n) = number of nonzero m X n binary arrays with all 1's connected.at n=33A287151
• Numbers with more than one Collatz tripling step whose odd Collatz trajectory does not contain primes.at n=26A319936
• Number T(n,k) of permutations p of [n] such that |p(i+k) - p(i)| <> k for i in [n-k]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=41A333706
• Triangle read by rows: T(n,k) is the number of polygons with 2*n sides, of which k run through the center of a circle, on the circumference of which the 2*n vertices of the polygon are arranged at equal spacing, up to rotation and reflection.at n=34A358329
• Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 2*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 + 2*x^2.at n=52A368157