28586

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=15A049948
• Number of basis partitions of n+36 with Durfee square size 6.at n=32A053801
• Number of basic blocks of size 5xn for tilings with square tiles of size up to 5 X 5.at n=15A054858
• Number of planar n X n X n binary triangular grids with mirror symmetry about one altitude with no more than 2 ones in any 3 X 3 X 3 subtriangle.at n=2A153912
• Triangle read by rows: T(n,k) is the number of non-equivalent regular polygons with n+1 edges, one of which is rooted, which are dissected by non-intersecting diagonals into k regions, such that two such polygons are identified up to reflection along the rooted edge and twisting along the diagonals that does not affect the root edge (for 1 <= k <= n-1 and n >= 2).at n=60A232206
• Number of partitions of (3, n) into a sum of distinct pairs.at n=31A268346
• a(n) = Sum_{d|n} d^2 * (d+1)/2.at n=35A278403
• Number of canonical forms for separation coordinates on hyperspheres S_n, ordered by increasing number of independent continuous parameters.at n=60A295380