27650

Appears in sequences

• a(0) = 1, a(n) = 27*n^2 + 2 for n>0.at n=32A010017
• Numbers n not of the form i^2+(i+1)^2 such that there are integers a < b with a^2+(a+1)^2+...+(n-1)^2 = n^2+(n+1)^2+...+b^2.at n=21A094523
• Numbers that are 4-digit palindromes in at least 2 bases.at n=33A180453
• L.g.f.: Sum_{n>=1} (x^n/n) * Product_{d|n} (1 + n*x^d/d).at n=42A205477
• Number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock having nonzero determinant and commuting with every horizontal or vertical neighbor.at n=20A207143
• Number of (n+1) X 4 0..2 arrays with every 2 X 2 subblock having nonzero determinant and commuting with every horizontal or vertical neighbor.at n=19A207144
• Number of (n+1) X 5 0..2 arrays with every 2 X 2 subblock having nonzero determinant and commuting with every horizontal or vertical neighbor.at n=18A207145
• Number of (n+1) X 6 0..2 arrays with every 2 X 2 subblock having nonzero determinant and commuting with every horizontal or vertical neighbor.at n=17A207146
• Number of (n+1) X 7 0..2 arrays with every 2 X 2 subblock having nonzero determinant and commuting with every horizontal or vertical neighbor.at n=16A207147
• Number of (n+1) X 8 0..2 arrays with every 2 X 2 subblock having nonzero determinant and commuting with every horizontal or vertical neighbor.at n=15A207148
• Smallest palindromic numbers of length 4 in two bases differing by n.at n=9A216843
• Number of (1+1) X (n+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally, diagonally or antidiagonally, with no adjacent elements equal.at n=12A232516
• Number of (n+1)X(4+1) arrays of permutations of 0..n*5+4 filled by rows with each element moved a city block distance of 1 or 2, and rows and columns in increasing lexicographic order.at n=1A263585
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 filled by rows with each element moved a city block distance of 1 or 2, and rows and columns in increasing lexicographic order.at n=11A263586
• Number of (2+1)X(n+1) arrays of permutations of 0..n*3+2 filled by rows with each element moved a city block distance of 1 or 2, and rows and columns in increasing lexicographic order.at n=3A263588
• Number of 4 X n Fibonacci minimal checkerboards.at n=6A349817
• Largest cost for a permutation problem.at n=43A367185