2621441

Appears in sequences

• a(n) = T(4,n), array T given by A048472.at n=16A048476
• Using Euler's 6-term sequence A014556, we define the partial recurrence relation a(0)=2, a(1)=3, a(2)=5; a(k) = 2*a(k-1) - 1 - (-2)^(k-2), 3 <= k <= 5.at n=21A082605
• a(0) = 6; for n>0, a(n) = 2*a(n-1) - 1.at n=19A083575
• A132749 * [1, 2, 3, ...] = A007318 * A065190.at n=18A132750
• a(n) = 10*4^n+1.at n=9A199209
• a(n) = 10*8^n+1.at n=6A199557
• Number of (not necessarily maximal) cliques in the n-cube-connected cycle graph.at n=13A295926
• Clique covering number of the n-Sierpinski tetrahedron graph.at n=11A307702
• a(n) = 5*2^n - (-1)^n.at n=19A321643
• Numbers that are the concatenation of a square and a cube, and also the concatenation of a cube and a square.at n=37A363835