22683

Appears in sequences

• Markoff numbers (A002559) multiplied by 3.at n=19A086326
• Numbers k such that (k+j) mod (2+j) = 1 for j from 0 to 8 and (k+9) mod 11 <> 1.at n=8A096026
• Numbers n such that Maple 9.5, Maple 10, Maple 11 and Maple 12 give the wrong answers for the number of partitions of n.at n=21A110375
• Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 0101 (n,k>=0).at n=59A118869
• Number of binary sequences of length n containing exactly one subsequence 0101.at n=16A118871
• Number of standard Young tableaux with shapes corresponding to partitions into distinct parts.at n=12A218293
• Equals one maps: number of n X 3 binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..3 n X 3 array.at n=4A221059
• T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..3 nXk array.at n=25A221062
• T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..2 nXk array.at n=25A221660
• Number of distinct, irreducible ways that a Pythagorean hyperrectangle of 2 or more dimensions can produce diagonal length n.at n=51A375338