35036

Appears in sequences

• Numbers n such that 6*10^n + 4*R_n - 1 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=23A103035
• Number of (n+2) X (5+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00010101 or 01010101.at n=6A259739
• Number of (n+2) X (7+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00010101 or 01010101.at n=4A259741
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 41", based on the 5-celled von Neumann neighborhood.at n=38A269874
• Number of nX2 0..1 arrays with no 1 equal to more than two of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element.at n=8A283341
• T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than two of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element.at n=46A283347
• Number of nX3 0..1 arrays with every element unequal to 0, 1, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=17A318077
• Expansion of Product_{k>0} theta_3(q^k)/theta_4(q^k), where theta_3() and theta_4() are the Jacobi theta functions.at n=12A320967
• Expansion of 1/(1 - x) * Product_{k>=0} 1/(1 - x^(4^k))^(4^(k+1)).at n=13A321345
• Lexicographically earliest sequence of distinct positive integers such that a(n), a(n+1) and the product a(n)*a(n+1) have in common the substring n.at n=35A333933
• a(n) = Sum_{k=0..n} binomial(n+2*k+1,k).at n=6A385250