26759

Properties

Appears in sequences

• Numbers that are the sum of 9 nonzero 8th powers.at n=36A003387
• Weighted count of partitions with distinct parts.at n=41A005895
• Multiplicity of highest weight (or singular) vectors associated with character chi_37 of Monster module.at n=39A034425
• Least prime in A031936 (lesser of 18-twins) whose distance to the next 18-twin is 2*n.at n=3A052358
• Primes p that have exactly three primitive roots that are not primitive roots mod p^2.at n=11A060519
• a(1) = 2, a(2) = 3 and a(n) = the smallest prime which is a linear combination of all previous terms with all coefficients >= 1.at n=14A072537
• Number of length n+4 0..4 arrays with every five consecutive terms having the maximum of some two terms equal to the minimum of the remaining three terms.at n=3A254694
• T(n,k)=Number of length n+4 0..k arrays with every five consecutive terms having the maximum of some two terms equal to the minimum of the remaining three terms.at n=24A254698
• Number of length 4+4 0..n arrays with every five consecutive terms having the maximum of some two terms equal to the minimum of the remaining three terms.at n=3A254702
• a(n) is the first prime p such that q*r mod p = q*r mod s = 12*n, where q,r,s are the next three primes after p.at n=35A338615
• Primes p, not safe primes, such that the smallest factor of (2^(p-1)-1) / 3 is equal to p.at n=33A360827
• For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) for any of these points; a(n) = minimum M(L) over all lines with C(L) = n, or -1 if there is no such line.at n=32A376187
• For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.at n=31A376188
• For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.at n=32A376188
• Numbers m which satisfy the equation: (m - floor((m - k)/k)) mod k = 1 (1 <= k <= m) only for k = 2 and m - 1.at n=41A378275
• a(n) is the number of multisets of n positive decimal digits where the sum of the digits equals the product of the prime digits.at n=47A384505
• Prime numbersat n=2937