27308

Appears in sequences

• Partitioning integers to avoid arithmetic progressions of length 3.at n=24A006999
• a(0)=2, a(1)=8, a(n) = a(n-1) + 2*a(n-2).at n=13A115102
• a(n) = 4*a(n-1) - 4 for n>0, a(0)=3.at n=7A135583
• Number of binary strings of length n with no substrings equal to 0001 or 1100.at n=18A164400
• Smallest index at which A242018 contains a run of n consecutive 1s.at n=4A242020
• Number of (n+2) X (2+2) 0..1 arrays with no 3 X 3 subblock diagonal sum 0 and no antidiagonal sum 3 and no row sum 0 or 3 and no column sum 0 or 3.at n=14A258960
• Relative of Hofstadter Q-sequence: a(n) = max(0, n+27298) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0.at n=13A283888
• Total number of binary digits in the partitions of n into odd parts.at n=40A319142
• a(n) is the index of the first occurrence of the Euclidean distance prime(n) from a point on a square spiral to its starting point at 1.at n=22A336335
• G.f. A(x) satisfies: A(x) = 1 + x + x^2 * A(x) / (1 - x) + x^2 * A(x)^2.at n=13A349014
• Numbers k such that k^7*2^k - 1 is a prime.at n=15A367561