44368

Appears in sequences

• Number of n-bead necklaces with 3 colors.at n=12A001867
• a(1) = 0, a(2) = -2; for n > 2, a(n) + a(n-2) - a(n-3) - a(n-5) - ... - a(n-p) = (-1)^(n+1)*n if n is prime, otherwise = 0, where p = largest prime < n.at n=58A002120
• Number of different words that can be formed from an n X n grid of letters, reading horizontally, vertically or diagonally.at n=23A034720
• Number of necklaces with n beads of 4 colors, no 2 adjacent beads the same color.at n=11A106366
• Triangle read by rows: T(n,k) is the number of Dyck paths with no UUU's and no DDD's, of semilength n and having k UUDUDD's starting at level 0 (0 <= k <= floor(n/3); U=(1,1), D=(1,-1)).at n=52A166295
• Number of distinct n X 3 toroidal 0..2 arrays.at n=3A184280
• Number of distinct n X 4 toroidal 0..2 arrays.at n=2A184281
• Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..2 arrays.at n=17A184284
• Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..2 arrays.at n=18A184284
• Number of 4-step knight's tours on an (n+2) X (n+2) board summed over all starting positions.at n=11A186853
• Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=18A192957
• Number of 6-cycles in the n X n black bishop graph.at n=8A289160
• Number of integer partitions of n of odd rank.at n=45A340692