30666

Appears in sequences

• Numbers k such that 189*2^k+1 is prime.at n=28A032471
• Numbers k such that k*2^k+(k-1) is prime.at n=12A046849
• Number of walks within N^2 (the first quadrant of Z^2) starting and ending at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 0), (-1, 1), (0, 1), (1, -1), (1, 0)}.at n=10A151358
• Number of ways to place n nonattacking composite pieces queen + rider[1,4] on an n X n chessboard.at n=15A189874
• a(n) = Sum_{i=0..n} digsum(i)^4, where digsum(i) = A007953(i).at n=18A231689
• a(n) = 2 * A000538(n).at n=9A259108
• a(n) = total number of convex equilateral n-gons with corner angles of m*Pi/n (0 < m <= n).at n=13A262181
• Number of distinct convex equilateral n-gons having rotational symmetry and with corner angles of m*Pi/n (0 < m <= n).at n=13A292355
• A(n,k) is (1/k) times the number of n-member subsets of [k*n] whose elements sum to a multiple of n; square array A(n,k), n>=1, k>=1, read by antidiagonals.at n=52A309148
• (1/3) times the number of n-member subsets of [3n] whose elements sum to a multiple of n.at n=7A309182
• a(n) = ((p-1)^n + (p+1)^n) mod p^2, where p is the n-th prime.at n=56A379544
• Number of subsets of 8 integers between 1 and n such that their sum is 0 modulo n.at n=15A381291