102201

Appears in sequences

• a(1) = 1, a(n) = smallest palindrome not included earlier such that a(1)+...+a(n) is a palindrome.at n=33A073880
• Triangle read by rows in which row n gives n smallest palindromic numbers of n digits each.at n=17A081930
• Smallest n-digit palindrome with a digit sum of n.at n=5A083440
• Palindromes in which, in the first half of the number, digits appear in the order 1, 0, 2, 3, 1, 0, 2, 3, 1, ...at n=5A089183
• The n-th row of the following array contains all palindromes, with at most n digits, with digit sum n. Sequence contains the array by rows.at n=31A109858
• Palindromes in base 3 (written in base 3).at n=37A118594
• Templates for lunar primes in any base (version 1).at n=23A171750
• Digitally balanced numbers: ternary numbers which have the same number of 0's as 1's as 2's.at n=14A181986
• Templates for lunar primes in any base (version 3).at n=16A191420
• Dates after Jan 01 00 in chronological order which are palindromic when they are written according to the format MMDDYY (American standard, short). Leading zeros of the terms are suppressed.at n=1A210895
• Palindromes in base 16 whose squares are also palindromes.at n=36A241096
• Smallest palindrome of each distinct decimal type (A002113) in increasing order.at n=13A264406
• Number of n X 4 integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself.at n=6A266127
• T(n,k) = Number of n X k integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself.at n=51A266131
• a(n) = palindrome arising when A228407(n+1) is formed (if there is more than one, use the smallest).at n=27A303571
• a(n) = palindrome arising when A228407(n+1) is formed (if there is more than one, use the smallest).at n=28A303571
• a(n) = palindrome arising when A228407(n+1) is formed (if there is more than one, use the smallest).at n=29A303571