56321

Appears in sequences

• a(n) = Fibonacci(n)*2^n + 1.at n=10A006483
• a(n) = T(4,n), array T given by A048472.at n=11A048476
• a(n) = T(n,n), array T given by A048472.at n=10A048482
• Least k such that k*10^n-9, k*10^n-7, k*10^n-3 and k*10^n-1 are all prime.at n=19A064432
• Define C(n) by the recursion C(0) = 4*i where i^2 = -1, C(n+1) = 1/(1 + C(n)), then a(n) = 4*(-1)^n/Im(C(n)) where Im(z) denotes the imaginary part of z.at n=10A069961
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2) + 2, where a(0) = 1, a(1) = 2, b(0) = 3.at n=19A294534
• Number of (not necessarily maximal) cliques in the n-cube-connected cycle graph.at n=8A295926