32507

Properties

Appears in sequences

• Number of binary rooted trees with n nodes and height at most 7.at n=19A036590
• Smallest number that can be written in binary representation as concatenation of other primes in exactly n ways.at n=45A090424
• Indices of primes in sequence defined by A(0) = 39, A(n) = 10*A(n-1) - 61 for n > 0.at n=16A101831
• Primes 2 less than a tetrahedral number.at n=5A162904
• Least prime p == -1 (mod n) that divides Fibonacci((p+1)/n), or 0 if no such prime exists.at n=42A168172
• Primes such that when they are concatenated with their 10's complement (which also must be prime), the result is a brilliant number.at n=17A168466
• Equals two maps: number of nX4 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal, diagonal and antidiagonal neighbors in a random 0..2 nX4 array.at n=3A220793
• T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal, diagonal and antidiagonal neighbors in a random 0..2 nXk array.at n=24A220794
• Equals two maps: number of 4Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal, diagonal and antidiagonal neighbors in a random 0..2 4Xn array.at n=3A220797
• Integer solutions to n^4 = x^3 + y^2 (values of y sorted by n).at n=8A221745
• Integers, a, which are the solutions to the equation a^2 + b^3 = c^4, with integers a, b > 0, and indexed off of A242183.at n=32A242184
• Primes p such that 2*p + 11 is a square.at n=35A269784
• Least k > 1 such that phi(k*n-1) = phi(k*n+1), or -1 if no such k exists.at n=27A276052
• Least k such that phi(k*n-1) = phi(k*n+1), or -1 if no such k exists.at n=27A276373
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 427", based on the 5-celled von Neumann neighborhood.at n=28A288137
• Expansion of 1 / Sum_{k>=0} (-x)^(k*(3*k - 1)/2).at n=42A308806
• Primes p such that q=p^2+p+1 is prime and (q^2+q+1)/3 is prime.at n=38A322748
• Primes p such that p^3 - 1 has 8 divisors.at n=31A341659
• Primes p such that p^7 - 1 has 8 divisors.at n=24A341669
• Primes p that can be written as phi(k) + d(k) for some k, where phi(k) = A000010(k) is Euler's totient function and d(k) = A000005(k) is the number of divisors of k.at n=31A357916