18931

Appears in sequences

• Fibonacci sequence beginning 3, 10.at n=17A022122
• Numbers n such that 121*2^n-1 is a prime.at n=15A050586
• a(1)=4, then least semiprime > a(n-1) such that when all in the sequence are concatenated together they form a prime.at n=37A085703
• The point to which the powers of n merge on an 8-digit calculator.at n=19A216070
• Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X 2 array.at n=21A220147
• Number of (n+2)X(1+2) 0..2 arrays with every consecutive three elements in every row having 2 or 3 distinct values, in every column 1 or 2 distinct values, in every diagonal 2 distinct values, and in every antidiagonal 2 distinct values, and new values 0 upwards introduced in row major order.at n=2A252877
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every consecutive three elements in every row having 2 or 3 distinct values, in every column 1 or 2 distinct values, in every diagonal 2 distinct values, and in every antidiagonal 2 distinct values, and new values 0 upwards introduced in row major order.at n=5A252882
• Number of (3+2)X(n+2) 0..2 arrays with every consecutive three elements in every row having 2 or 3 distinct values, in every column 1 or 2 distinct values, in every diagonal 2 distinct values, and in every antidiagonal 2 distinct values, and new values 0 upwards introduced in row major order.at n=0A252885
• Solution of the complementary equation a(n) = 2*a(n-1) + b(n-1), where a(0) = 2, a(1) = 5, b(0) = 1, and (a(n)) and (b(n)) are increasing complementary sequences.at n=12A295057