27972

Appears in sequences

• Expansion of e.g.f.: sin(log(1+x)*cosh(x)).at n=8A009463
• Least positive palindromic multiple of n, or 0 if none exists.at n=54A020485
• Even 10-gonal (or decagonal) numbers.at n=42A028994
• Palindromes with exactly 7 prime factors (counted with multiplicity).at n=1A046333
• Obtain m by omitting trailing zeros from n (cf. A004151); a(n) = smallest multiple k*m which is a palindrome.at n=54A061816
• Smallest palindrome beginning with n and a digit sum of n at some stage.at n=26A082935
• a(n) is the odd-length palindrome whose digits up to the center are those of n and whose center digit is equal to the digital root of the product of the factorial of n and the reverse of n.at n=26A082941
• a(n) = concatenate(n, A010888(2*n), reverse(n)), where A010888 = digital root.at n=26A082944
• a(1) = 1; a palindrome is included in the sequence if it has a prime signature that is different from all previous terms.at n=27A083433
• Smallest palindromic multiple of 2n-1 beginning with the digit string of 2n-1; or 0 if no such number exists.at n=13A083964
• Smallest palindromic multiple of n in which n is a substring (anywhere), or 0 if n = 10k or no such number exists.at n=26A084044
• Least palindromic multiple of composite(n), or 0 if no such number exists.at n=36A110750
• Palindromes whose squares belong to A066531.at n=6A117281
• 10-gonal numbers for which the sum of the digits is also a 10-gonal number.at n=11A119547
• 10-gonal numbers which are divisible by the sum of their digits.at n=29A119548
• Palindromic numbers that contain the sum of their digits as a substring.at n=24A121939
• Number of tieless basketball games from the years 1896-1967 with n scoring events.at n=8A135489
• Size of the BDD for the hidden weighted bit function, with the variables in their natural ordering.at n=27A136445
• Number of 4-way intersections in the interior of a regular 6n-gon.at n=36A137938
• A121153 \ A005836.at n=13A170830