18664

Appears in sequences

• a(n) = 6*a(n-1) - 8.at n=5A005618
• Number of polydrafters: a(n) is the number of polydrafters with n cells.at n=7A056842
• Sum of GCD's of parts in all partitions of n.at n=35A078392
• Number of n-digit base-4 deletable primes.at n=9A096237
• For positive n with prime decomposition n = Product_{j=1..m} (p_j^k_j) define A_n = Sum_{j=1..m} (p_j*k_j) and B_n = Sum_{j=1..m} (p_j^k_j). This sequence gives those n for which A_n and B_n are both prime and B_n = A_n + 2 (i.e., form a twin prime pair).at n=35A185718
• a(n) = (n^2 + 2*(Sum_{j = 1..n} j^n)) (mod n^3).at n=39A219540
• a(n) is a refactorable number and the sum of all refactorable numbers <= a(n) is also a refactorable number.at n=39A235177
• Sum of positive ranks of all overpartitions of n.at n=20A236001
• Number of (n+1) X (6+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction.at n=6A250609
• Number of (n+1) X (7+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction.at n=5A250610
• Number of (not necessarily maximal) cliques in the n X n king graph.at n=43A295906