35500

Appears in sequences

• Numbers k such that 2^k - F(k) is prime, where F(n) is the n-th Fibonacci number.at n=18A074716
• Number of (n+2) X 7 0..3 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..3 introduced in row major order.at n=7A204639
• Number of (n+1) X 3 0..1 arrays with every 2 X 2 subblock having the same number of equal edges, and new values 0..1 introduced in row major order.at n=5A205312
• Number of (n+1)X7 0..1 arrays with every 2X2 subblock having the same number of equal edges, and new values 0..1 introduced in row major order.at n=1A205316
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock having the same number of equal edges, and new values 0..1 introduced in row major order.at n=22A205318
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock having the same number of equal edges, and new values 0..1 introduced in row major order.at n=26A205318
• Number of partitions of n containing at least one part m-3 if m is the largest part.at n=45A212543
• Number of partitions of n with difference -5 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=48A242687
• a(n) = number of triangles that can be formed from the points of a 3 X n grid.at n=20A262402
• E.g.f. = exp(5*(exp(t)-1) + 3*(exp(t)-1)^2).at n=5A278576
• Number of binary strings of length n avoiding substrings 1000, 1011, 1101, or 1111.at n=25A294049
• Triangle read by rows: T(n,k) is the number of k-regular graphs on n unlabeled nodes with half-edges.at n=70A333161
• Triangle read by rows: T(n,k) is the number of k-regular graphs on n unlabeled nodes with half-edges.at n=73A333161
• Numbers k such that sigma(k) = psi(k) + tau(k)^3.at n=8A390297