90109
domain: N
Appears in sequences
- Palindromes that start with 9.at n=23A043044
- Composite numbers in A083137.at n=21A083138
- Palindromes that cannot be expressed as the difference of two palindromes.at n=2A083142
- 10^n-th palindrome.at n=3A083816
- Palindromic brilliant numbers.at n=34A084350
- Beginning with 1, palindromes such that successive differences are distinct primes.at n=21A088052
- Palindromes whose perfect deficiency (A109883) is also palindromic.at n=22A110002
- Palindromic brilliant numbers whose number of binary ones is also brilliant.at n=12A121209
- a(n) = 2*a(n-1)+3 with n>1, a(1)=8.at n=13A156198
- Numbers n with property that n^2 starts and ends with 81.at n=14A159775
- 9+10^n+9*100^n.at n=2A171226
- Palindromic composite numbers starting with a digit 9.at n=21A222729
- Number T(n,k) of permutations p of [n] such that k is the maximum of 0 and the number of elements in any integer interval [p(i)..i+n*[i<p(i)]]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=53A324563
- Number T(n,k) of permutations p of [n] such that n-k is the maximum of 0 and the number of elements in any integer interval [p(i)..i+n*[i<p(i)]]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=46A324564
- Number of permutations p of [1+n] such that n is the maximum of the number of elements in any integer interval [p(i)..i+(1+n)*[i<p(i)]].at n=8A324621
- Number of permutations p of [n] such that eight is the maximum of the number of elements in any integer interval [p(i)..i+n*[i<p(i)]].at n=1A324635
- a(n) = abs(a(n-1) - a(n-2)) if a(n-1) and a(n-2) are both prime or both composite. a(n) = a(n-1) + a(n-2) otherwise, where a(1) = 1 and a(2) = 2 and n > 2.at n=47A341130
- a(n) is the least A000120-perfect number (A175522) whose binary weight (A000120) is n, or 0 if no such number exists.at n=13A360643