27903

Appears in sequences

• Fibonacci sequence beginning 4, 15.at n=17A022133
• a(n) = 6*Lucas(2n) - Fibonacci(2n+2).at n=9A097512
• Numbers n such that p(6n) is prime, where p(n) is the number of partitions of n.at n=43A111036
• Number of (n+2) X (2+2) 0..1 arrays with no 3 x 3 subblock diagonal sum 1 and no antidiagonal sum 1 and no row sum 0 or 1 and no column sum 0 or 1.at n=6A255153
• Number of (n+2)X(7+2) 0..1 arrays with no 3x3 subblock diagonal sum 1 and no antidiagonal sum 1 and no row sum 0 or 1 and no column sum 0 or 1.at n=1A255158
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 1 and no antidiagonal sum 1 and no row sum 0 or 1 and no column sum 0 or 1.at n=29A255159
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 1 and no antidiagonal sum 1 and no row sum 0 or 1 and no column sum 0 or 1.at n=34A255159
• Numbers k such that (19*10^k + 77) / 3 is prime.at n=24A276353
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 149", based on the 5-celled von Neumann neighborhood.at n=15A279180
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 169", based on the 5-celled von Neumann neighborhood.at n=15A286174
• Number of ways to choose a set partition of a strict integer partition of n.at n=33A294617
• If a(n-1) is not a prime, then a(n) = 2*a(n-1) + S; otherwise set S = -S and a(n) = prime(n) + S; start with a(1) = S = 1.at n=35A373805
• If a(n-1) is not a prime, then a(n) = 2*a(n-1) + S; otherwise set S = -S and a(n) = prime(n) + S; start with a(1) = 2, S = -1.at n=35A373808
• G.f. A(x) satisfies A(x) = 1/((1 - x*A(x)^3) * (1 - x*A(x))^2).at n=5A379186
• Number of hexagonal n-element polyominoes whose graph is a nonextensible path.at n=9A383731