49932
domain: N
Appears in sequences
- a(n) = floor(2^(n-1)/n).at n=20A006788
- a(n) = (n^7 - n)/42.at n=8A030180
- Nearest integer to 2^(n-1)/n.at n=20A054650
- Mean of first six positive powers of n, i.e., (n + n^2 + n^3 + n^4 + n^5 + n^6)/6.at n=8A059721
- Duplicate of A006788.at n=20A074099
- Number of simple directed graphs on n labeled nodes consisting only of some cycle graphs C_2 and nodes not part of a cycle having directed edges to both nodes in exactly one cycle.at n=9A133189
- Triangle T(n,k) = number of forests of labeled rooted trees of height at most 1, with n labels, where each root contains k labels, n>=0, 0<=k<=n.at n=47A143398
- Square array A(n,k), n>=0, k>=0, read by antidiagonals, where sequence a_k of column k is the exponential transform of C(n,k).at n=75A145460
- Fast "exotic addition" a o b = [ a[1]+b[1], a[1]*b[2]+a[2]*b[1] ].at n=37A175841
- Partial sums of round(4^n/7).at n=9A178872
- a(n) = floor((1 + 4^n)/(1 + 2*n)).at n=9A191637
- Number of (n+2)X(n+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally and vertically.at n=2A257202
- Number of (n+2)X(3+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally and vertically.at n=2A257204
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally and vertically.at n=12A257209
- Renyi-Ulam liar numbers: maximum k such that n questions "Is x in subset S of {1,...,k}?" are guaranteed to determine x when at most one answer can be a lie.at n=20A286496
- Number of nX3 0..1 arrays with every element unequal to 2, 3 or 4 king-move adjacent elements, with upper left element zero.at n=12A303685