64560

Appears in sequences

• Consider the sequence {b(m)} of composite numbers (excluding 1); sequence gives values of b(m) where gcd(m, b(m)) increases.at n=30A058012
• a(n) = A080315(n) - 2^A000523(A080315(n)), i.e., the terms of A080315 without their most significant bit.at n=15A080316
• A014486-encoding of the Catalan mountain ranges with only even-length slopes allowed.at n=20A083932
• Number of 7 X 7 arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to n.at n=26A156392
• Number of n X n arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to 26.at n=5A156485
• Number of acute isosceles triangles on an n X n grid.at n=16A190317
• Number of functions f:{1,2,...,n}->{1,2,...,n} with all cycles of length >= 4.at n=7A208230
• Number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock diagonal maximum minus antidiagonal maximum unequal to its neighbors horizontally, vertically, diagonally and antidiagonally.at n=2A253306
• Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock diagonal maximum minus antidiagonal maximum unequal to its neighbors horizontally, vertically, diagonally and antidiagonally.at n=2A253309
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal maximum minus antidiagonal maximum unequal to its neighbors horizontally, vertically, diagonally and antidiagonally.at n=12A253314
• Binomial transform of A026007.at n=11A294502
• Number of nX6 0..1 arrays with every element equal to 0, 1, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=7A300087
• Numbers k such that 385*2^k+1 is prime.at n=43A322998