18881

Appears in sequences

• Numbers with mirror symmetry about middle.at n=25A006072
• Palindromic in bases 5 and 10.at n=13A029962
• a(n) = floor(n^3 / Pi).at n=39A032633
• Palindromic quotients (k*(k+1)*(k+2)) / (k+(k+1)+(k+2)).at n=9A032790
• Sums of 5 distinct powers of 5.at n=12A038477
• a(n) = smallest palindrome > a(n-1) such that a(1)*a(2)*...*a(n) + 1 is prime with a(1) = 2.at n=21A051896
• Numbers n for which there are exactly nine k such that n = k + reverse(k).at n=37A072433
• Greedy frac multiples of Pi^2/6: a(1)=1, Sum_{n>=1} frac(a(n)*x) = 1 at x = Pi^2/6.at n=12A079937
• Number of 3-block covers of a labeled n-set.at n=4A095152
• Number of matrices of any size up to column permutations, with n different elements, zero elsewhere and with no zero row or column.at n=5A104600
• Indices of primes in A057137.at n=5A120819
• a(n) = least k such that the remainder when 26^k is divided by k is n.at n=12A128366
• a(n) = a(n-1) + a(floor(n/2)) + a(ceiling(n/2)).at n=34A131205
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (-1, 1, 1), (1, 0, -1), (1, 0, 0)}.at n=10A148267
• a(n) = 12*n^2 - 8*n + 1.at n=40A185212
• a(n) = n 8's sandwiched between two 1's.at n=3A205088
• Numbers n such that A229964(n) = 3.at n=21A229966
• Number of self-inverse permutations p on [n] where the maximal displacement of an element equals 3.at n=14A238914
• Number of (n+2)X(3+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 or 1 and no antidiagonal sum 0 or 1 and no row sum 1 and no column sum 1.at n=4A256024
• Number of (n+2)X(5+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 or 1 and no antidiagonal sum 0 or 1 and no row sum 1 and no column sum 1.at n=2A256026