34443
domain: N
Appears in sequences
- Octal palindromes which are also primes.at n=36A006341
- Denominators of continued fraction convergents to sqrt(347).at n=13A041657
- a(n) = smallest palindrome > a(n-1) such that a(1)*a(2)*...*a(n) + 1 is prime with a(1) = 2.at n=27A051896
- Second member of Diophantine pair (m,k) that satisfies 6*(m^2 + m) = k^2 + k: a(n) = k.at n=9A077291
- Smallest multiple of n which begins with R(n) and ends in n where R(n) (A004086) is the digit reversal of n. Suitable number of zeros are assumed to the left of the MSD if required.at n=42A077741
- Let p = n-th prime of the form 4k+3, take the solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with x and smallest y >= 1; sequence gives value of y.at n=35A082394
- a(n) = T(n) concatenated with reverse(T(n)) divided by 11, where T(n) is the n-th triangular number.at n=27A084008
- Smallest palindromic multiple of n in which n is a substring (anywhere), or 0 if n = 10k or no such number exists.at n=42A084044
- Expansion of g.f. x*(2+22*x+11*x^2)/((x-1)*(1+x)*(10*x^2-1)).at n=9A094625
- Number of A095284-primes in range ]2^n,2^(n+1)].at n=20A095294
- Number of A095322-primes in range ]2^n,2^(n+1)].at n=20A095324
- Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 6 and (n+7) mod 9 <> 1.at n=27A096025
- a(1) = 1, then the rearrangement of odd palindromes such that every concatenation is a prime for n > 1.at n=23A113578
- Numbers n such that d(n + d(n)) = d(n), where d(n) is the sum of the distinct primes dividing n.at n=30A175760
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant in {0,1,...,n}.at n=25A209995
- Palindromes p = A002113(n) whose index n is a substring of p.at n=4A248753
- Palindromes p=A002113(n) whose index n is also a palindrome and in addition a substring of p (strings in base 10).at n=4A248754
- Nonnegative integers k such that k! mod nextprime(k) is larger than k.at n=22A360805