104968

Appears in sequences

• Number of n-bead necklaces with 4 colors.at n=10A001868
• a(n) = a(n-2) + a(n-3), with a(0) = 0, a(1) = 1, a(2) = 2.at n=42A007307
• a(n+3) = 5*a(n+2)-4*a(n+1)+a(n).at n=10A012866
• An intermediate sequence for nonisomorphic circulant directed p^2-graphs, indexed by odd primes p.at n=3A038779
• Number of ways to color vertices of a 10-gon using <= n colors, allowing only rotations.at n=4A054624
• Number of complementary pairs of circulant digraphs on n nodes.at n=21A054930
• Number of partitions of n having nonnegative even rank (the rank of a partition is the largest part minus the number of parts).at n=53A101709
• Number of necklaces with n beads of 5 colors, no 2 adjacent beads the same color.at n=9A106367
• Expansion of (1-x-2*x^2)/(1-x^2+x^3).at n=46A109248
• a(n) = A098601(2n) + A098601(2n+1).at n=20A137495
• a(n) = 3*a(n-1) - 2*a(n-2) + a(n-3).at n=13A137531
• Transform of the finite sequence (1, 0, -1) by the T_{0,0} transformation.at n=15A159347
• Number of binary strings of length n with no substrings equal to 0010 0101 or 1010.at n=16A164494
• Number of distinct n X 2 toroidal 0..3 arrays.at n=4A184273
• Number of distinct n X 5 toroidal 0..3 arrays.at n=1A184276
• Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..3 arrays.at n=16A184277
• Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..3 arrays.at n=19A184277
• a(n) is the number of graceful graphs with n edges and round(sqrt(3n+9/4)) vertices.at n=32A343296
• Table read by downward antidiagonals: T(n,k) is the number of tilings of the n X k cylinder up to vertical reflections by two tiles that are each fixed under vertical reflection.at n=32A368260
• Table read by downward antidiagonals: T(n,k) is the number of tilings of the n X k cylinder up to vertical reflection by an asymmetric tile.at n=32A368261