18995

Appears in sequences

• Number of independent sets of nodes in C_4 X C_n (n > 2).at n=6A050402
• Numbers k such that 5^k + 2 is a prime.at n=9A087885
• Numbers k such that 2^k == 18 (mod k).at n=9A128126
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, -1, 0), (0, 1, -1), (1, 1, 1)}.at n=8A149672
• Number of independent sets of nodes in C_6 X C_n (n >= 1).at n=4A182052
• Positions of the incrementally largest terms in the continued fraction for Khinchin's constant.at n=8A224852
• Number of (n+1)X(1+1) 0..3 arrays colored with the sets of distinct values in every 2X2 subblock, with new values 0..3 introduced row-major order.at n=3A236259
• T(n,k) = Number of (n+1) X (k+1) 0..3 arrays colored with the sets of distinct values in every 2 X 2 subblock, with new values 0..3 introduced row-major order.at n=6A236262
• T(n,k) = Number of (n+1) X (k+1) 0..3 arrays colored with the sets of distinct values in every 2 X 2 subblock, with new values 0..3 introduced row-major order.at n=9A236262
• Indices of primes in the 7th-order Fibonacci number sequence, A060455.at n=41A253318
• Number of (n+2)X(2+2) arrays of permutations of 0..n*4+7 with each element moved 0 or 1 knight moves and equal numbers of elements advancing and retreating in the array numbered in row major order.at n=1A263705
• T(n,k)=Number of (n+2)X(k+2) arrays of permutations of 0..(n+2)*(k+2)-1 with each element moved 0 or 1 knight moves and equal numbers of elements advancing and retreating in the array numbered in row major order.at n=4A263706
• Number of (2+2) X (n+2) arrays of permutations of 0..n*4+7 with each element moved 0 or 1 knight moves and equal numbers of elements advancing and retreating in the array numbered in row major order.at n=1A263708
• Number of 2 X 2 matrices with all elements in {0,...,n} and prime permanent.at n=19A281090
• Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) -1, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=45A294867
• Solution of the complementary equation a(n) = 4*a(n-2) + b(n-2), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, and (a(n)) and (b(n)) are increasing complementary sequences.at n=13A295062