46664
domain: N
Appears in sequences
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 54.at n=7A031732
- a(n) = smallest palindrome > a(n-1) such that a(1)*a(2)*...*a(n) + 1 is prime with a(1) = 2.at n=32A051896
- The smallest magic constant for n X n magic square with prime entries (regarding 1 as a prime).at n=21A073502
- a(n) = A078218(n)/n.at n=25A078810
- Record-setting differences between adjacent elements of the Mian-Chowla sequence A005282.at n=43A080222
- Palindromes that are 1 more than a prime and 1 less than a triangular number.at n=5A098826
- Palindromic Smith numbers.at n=23A098834
- 5-almost primes with semiprime digits (digits 4, 6, 9 only).at n=18A111697
- Write n-th semiprime in binary, sum as if decimal numbers.at n=9A122467
- a(n) = 64*n^2 + 8.at n=26A158488
- Palindromes that are the sum of two positive cubes.at n=15A162710
- Number of nX2 0..6 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=5A200931
- T(n,k)=Number of nXk 0..6 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=22A200935
- T(n,k)=Number of nXk 0..6 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=26A200935
- Smallest palindrome which requires at least n iterations of Reverse and Add to reach a palindrome.at n=37A222533
- Numbers of the form 6^j + 8^k, for j and k >= 0.at n=37A226824
- Palindromic in base 10 and 18.at n=22A248889
- Number of (n+1) X (4+1) 0..1 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=7A250579
- Numbers k such that k multiplied by the sum of reciprocals of digits is the digit reversal of k.at n=9A309654
- Sequence lists numbers k > 1 such that k^4 == d(k) (mod sigma(k)), where d = A000005 and sigma = A000203.at n=30A323251