30605

Appears in sequences

• Numbers k such that k^2+k+9 is a palindrome.at n=23A027726
• Sum of the second moments of all partitions of n with weights starting from 0.at n=16A066188
• Number of distinct values of the sum of 5 products of three 0..n integers.at n=18A225262
• Number of (n+2)X(1+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 1, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=11A253417
• T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-1,-2) (0,-1) or (-1,0) and new values introduced in order 0..2.at n=47A274749
• Number of 3 X n 0..2 arrays with no element equal to any value at offset (-1,-2) (0,-1) or (-1,0) and new values introduced in order 0..2.at n=7A274750
• Number of valid hook configurations of 312-avoiding permutations of [n].at n=10A307786
• The sum of the numbers on straight lines of incrementing length n when drawn over numbers of the square spiral, where each line contains numbers which sum to the minimum possible value, and each number on the spiral can only be in one line. If two or more lines exist with the same sum the one containing the smallest number is chosen.at n=33A340974
• Total sum of the left-to-right strict peak maxima in all Dyck paths of semilength n.at n=9A346194