26436
domain: N
Appears in sequences
- Number of aperiodic necklaces with n red or blue beads such that two necklaces are equivalent under the operation of simultaneously turning the necklace over and switching the two colors.at n=19A066313
- a(n) = 11 + floor(Sum_{j-1..n-1} a(j)/4).at n=35A120168
- Number of integers i in range [A000302(n-1)..A024036(n)] of permutation A163355/A163356 with A163915(i)=i, but not A163355(i)=i.at n=12A163913
- Number of 0..12 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1.at n=3A171318
- Number of 0..n-1 integer arrays v[1..4] of length 4 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..3.at n=12A171355
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210861; see the Formula section of A210861.at n=38A210860
- Place n equally spaced points on each side of an equilateral triangle, and join each of these points by a chord to the 2*n new points on the other two sides: sequence gives number of regions in the resulting planar graph.at n=11A366486