349536

Appears in sequences

• a(n) is the number of distinct (infinite) output sequences from binary n-stage shift register which feeds back the complement of the last stage.at n=24A000016
• Number of binary vectors (x_1,...x_n) satisfying Sum_{i=1..n} i*x_i = 3 (mod n+1) = size of Varshamov-Tenengolts code VT_3(n).at n=23A054200
• Number of subsets of {1,2,3,...,n} that sum to 0 mod 12.at n=22A068033
• Expansion of the solution of a functional equation.at n=17A112483
• Number of binary vectors (x_1,...x_(n-1)) satisfying Sum_{i=1..n-1} (-1)^i*i*x_i = 0 (mod n).at n=22A114702
• a(n) = A000016(2*n).at n=12A300668