32958
domain: N
Appears in sequences
- Coefficients of ménage hit polynomials.at n=5A000181
- a(n) = floor(10000*log(n)).at n=26A004243
- a(n) = 10000*log(n) rounded to nearest integer.at n=26A004244
- Number of "bifix-free" words of length n over a three-letter alphabet.at n=10A019308
- Number of ternary words of length n (beginning with 0) with autocorrelation function 2^(n-1).at n=10A045694
- Triangle read by rows, giving coefficients of the ménage hit polynomials ordered by descending powers. T(n, k) for 0 <= k <= n.at n=50A058087
- Triangle read by rows: T(n,k) = number of ways of seating n couples around a circular table so that exactly k married couples are adjacent (0 <= k <= n).at n=49A094314
- Triangle T(n, k) = coefficients of p(n,x), where p(n,x) = Sum_{j=0..n} (2*n*(n-j)!/(2*n-j)) * binomial(2*n-j, j) * (x-1)^j and p(0,x) = 1, read by rows.at n=49A156996
- a(1)=1, a(n+1) = a(n) + p, where p is the largest prime < a(n) if a(n) is even and the smallest prime > a(n) if a(n) is odd.at n=14A277224
- Number of partitions of n into a squarefree number of parts.at n=42A286141