95326

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=22A000016
• a(n) = ceiling(2^(n-1)/n).at n=21A053637
• Inverse Moebius transform of A000048 (starting at term 0).at n=22A054172
• Number of subsets of {1,2,3,...,n} that sum to 0 mod 11.at n=20A068032
• 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=20A114702
• Number of frieze patterns of length n under a certain group (see Pisanski et al. for precise definition).at n=11A123046
• Integers k such that 10^k+57 is a prime number.at n=22A135119
• Numbers n such that 41#*2^n-1 is prime, where # denotes the primorial, A002110.at n=88A176061
• Numbers k such that 6*R_k + 7*10^k + 1 is prime, where R_k = 11...11 is the repunit (A002275) of length k.at n=12A259133
• Number of (n+3) X (1+3) 0..1 arrays with each row and column divisible by 11, read as a binary number with top and left being the most significant bits.at n=16A262236
• a(n) = A000016(2*n).at n=11A300668
• Number of nX5 0..1 arrays with every element unequal to 0, 1, 3, 4, 7 or 8 king-move adjacent elements, with upper left element zero.at n=10A316549
• a(n) is the index of the smallest n-gonal number with exactly n prime factors (counted with multiplicity).at n=21A359014