29467

Appears in sequences

• a(n) = [ 1/(2*t(n+1) - t(n) - t(n+2)) ], where t(n) = tan(Pi/2 - 1/n) satisfies n-1 < t(n) < n for all n >= 1.at n=25A024817
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 49 ones.at n=1A031817
• Number of 5-step S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=22A187379
• Equals two maps: number of nX6 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 nX6 array.at n=2A220327
• T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 nXk array.at n=30A220328
• Equals two maps: number of 3Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 3Xn array.at n=5A220330
• Number of partitions p of n such that #m(1) = #m(2), where #m(i) = number of numbers in p that have multiplicity i.at n=51A241518
• Number of compositions (ordered partitions) of n into distinct parts having a common factor > 1 with n.at n=56A332003
• Array T(n,m) read by antidiagonals: In an n X m grid draw straight walls between cells, starting at a border, such that the resulting figure is connected and has only one-cell wide paths; T(n,m) is the number of solutions up to symmetries of the rectangle.at n=49A375861
• Array T(n,m) read by antidiagonals: In an n X m grid draw straight walls between cells, starting at a border, such that the resulting figure is connected and has only one-cell wide paths; T(n,m) is the number of solutions up to symmetries of the rectangle.at n=50A375861