38683

Appears in sequences

• Composite palindromes with only palindromic prime factors whose sum is palindromic (counted with multiplicity).at n=16A046357
• Palindromes with exactly 2 palindromic prime factors (counted with multiplicity), and no other prime factors.at n=39A046376
• Palindromes with exactly 2 distinct palindromic prime factors.at n=35A046408
• Smallest nontrivial palindromic multiple of the n-th palindrome (a(n) is not equal to the n-th palindrome).at n=46A083145
• Smallest palindromic multiple of n-th palindrome which is not a concatenation of copies of that palindrome.at n=46A083146
• Palindromic brilliant numbers.at n=25A084350
• Smallest palindromic multiple (not equal to the number itself) of the palindromes not included earlier.at n=46A085920
• Expansion of (1 + 3x - 2x^2 - 12x^3)/(1 - 9x^2 + 20x^4).at n=12A097111
• Brilliant numbers (A078972) whose digit reversal is the product of 2 palindromes greater than 1.at n=36A115681
• Palindromic brilliant numbers whose number of binary ones is also brilliant.at n=9A121209
• Counts compositions as described by table A047969; however, only those ending with an odd part are considered.at n=59A123685
• 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, 0), (-1, 0, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 1)}.at n=9A149291
• Q-residue of the triangle p(n,k)=(2^(n - k))*5^k, 0<=k<=n, where Q is the triangular array (t(i,j)) given by t(i,j)=1. (See Comments.)at n=6A193656
• Composite palindromes whose divisors > 1 are all nontrivial palindromes (i.e., palindromes with at least two digits).at n=21A329100
• The number of vertices formed by straight line segments mutually connecting all vertices of a semicircular polygon defined in A333642.at n=29A330913
• Nonprime base-10 palindromes whose arithmetic derivative is a base-10 palindrome.at n=26A363248
• Palindromic squarefree semiprimes such that the sum of the two prime factors is also a palindrome.at n=14A374331