39348
domain: N
Appears in sequences
- Composite numbers k such that phi(k + d(k)) = phi(k) + d(k), where phi() = A000010(), d() = A000005().at n=25A063702
- Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^3-M)/2, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=38A096034
- a(n) = 1458*n - 18.at n=26A157508
- T(n,k) is the number of n-step one or two collinear space at a time queen's tours on a k X k board summed over all starting positions.at n=39A187027
- Number of 4-step one or two collinear space at a time queen's tours on an n X n board summed over all starting positions.at n=5A187029
- Number of (n+1) X 3 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly one clockwise edge increases.at n=8A207044
- a(n) = cpg(3, n) + cpg(4, n) + ... + cpg(n, n) where cpg(m, n) is the n-th m-th-order centered polygonal number.at n=20A257052
- a(n) = Sum_{-n<i<n, -n<j<n, gcd{i,j}=3} (n-|i|)*(n-|j|)/4.at n=38A331775
- E.g.f. A(x) satisfies A(x) = exp( 3 * x * (1 + x) * A(x)^(1/3) ).at n=5A372155