27450
domain: N
Appears in sequences
- Triangular array: T(n,1)=T(n,n)=n, for 1<k<n: T(n,k) = concatenation of T(n-1,k-1) and T(n-1,k) in binary representation.at n=22A079661
- Number of squares in an n X n grid of squares with diagonals.at n=29A111500
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k columns ending at an even level (1<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=37A121698
- Let s denote the sum of the abundant numbers in the aliquot parts of x. Sequence lists numbers x such that sigma(s) = usigma(x), where usigma(x) is the sum of the unitary divisors of x (A034448).at n=10A258135
- a(n) = 108*n^2 - 228*n + 114 (n>=2).at n=15A304618
- Number of positive solutions to (x_1)^2 + (x_2)^2 + ... + (x_5)^2 <= n^2.at n=9A341424
- Primitive terms of A108569.at n=21A346277
- Triangle read by rows: T(n,k) = A(k,n-k), 1 <= k < n, 2 <= n, where A(m,n) is the number of distinct strings consisting of one X, m+n-1 Y's and m+n-1 Z's in which the X lies to the right of at least m Y's and at least m Z's.at n=23A351585