32176

Appears in sequences

• Poupard's triangle: triangle of numbers arising in enumeration of binary trees.at n=27A008301
• Poupard's triangle: triangle of numbers arising in enumeration of binary trees.at n=33A008301
• Numbers n for which 8*R_n - 1 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=18A096846
• Number of regions formed inside square by diagonals and the segments joining the vertices to the points dividing the sides into n equal length segments.at n=42A108914
• Number of permutations avoiding the patterns {4321, 45132, 45231, 35412, 53412, 45213, 43512, 45312, 456123, 451623, 356124}; number of strong sorting class based on 4321.at n=9A111283
• a(n) = 6*a(n-1)-8*a(n-2) for n > 2; a(0)=837, a(1)=7896, a(2)=32176.at n=2A177846
• Left half of Poupard's triangle, A008301.at n=17A210108
• 10-step Fibonacci sequence starting with 0,0,0,0,0,1,0,0,0,0.at n=25A251762
• Number of set partitions of [n] such that seven is a multiple of each block size.at n=15A275425
• List of numbers n such that A039654(n) reaches a new record high.at n=31A292113
• Number of (not necessarily maximal) cliques in the n-odd graph.at n=7A295934
• Number of vertices in a "frame" of size n X n (see Comments in A331776 for definition).at n=14A332598
• Number of nonequivalent noncrossing cacti with n nodes up to rotation.at n=9A361242
• Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 2 + 4*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2*x - x^2.at n=31A367298
• Triangle read by rows: T(n,k) = number of j-covers of [n] with j<=k, k=1..2^n-1.at n=22A369950