45057

Appears in sequences

• a(n) = (n-1)*2^n + 1.at n=12A000337
• a(n) = round(sqrt(a(n-2)^2 + a(n-1)^2)) with a(0) = 1 and a(1) = 2.at n=43A063827
• Duplicate of A000337.at n=12A082753
• a(n) = 11*2^n + 1.at n=12A083683
• "Rounded hypotenuses": a(n) = round(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=1, a(2)=3.at n=42A104804
• Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs of consecutive 0's (0<=k<=ceiling(n/2)).at n=49A119808
• Triangle read by rows: T(n,k) = is the number of directed column-convex polyominoes of area n having along the lower contour exactly k reentrant corners, i.e., a vertical step that is followed by a horizontal step (n >= 1, k >= 0).at n=50A121466
• a(n) = 2*a(n-1) - 1 for n>1, a(1)=23.at n=11A122041
• a(n) = 44*n^2 + 1.at n=32A158630
• a(n) = 11*4^n + 1.at n=6A199211
• a(n) = 11*8^n+1.at n=4A199558
• a(n) = 4*n^3 + 5*n^2 + 2*n + 1.at n=22A204674
• Dodecanacci numbers (12th-order Fibonacci sequence): a(n) = a(n-1) +...+ a(n-12) with a(0)=...=a(11)=1.at n=24A207539
• Triangle of coefficients of polynomials u(n,x) jointly generated with A210198; see the Formula section.at n=50A210197
• Number of nX6 0..3 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..3 introduced in row major order.at n=1A241327
• T(n,k)=Number of nXk 0..3 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..3 introduced in row major order.at n=22A241328
• Number of 2 X n 0..3 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..3 introduced in row major order.at n=5A241329
• Number of sets of sequences of total length n over an alphabet of n letters with the symmetric group acting on the letters.at n=8A283612
• Integers of the form k*2^m + 1 where 0 < k <= m and k is odd.at n=46A361875