25793

Properties

Appears in sequences

• Frobenius number of the numerical semigroup generated by three consecutive pentagonal numbers.at n=17A069757
• Primes of the form perfect_power(n)+n.at n=23A075781
• Primes p equal to the sum of two successive sexy primes + 1 such that p + 6 is also prime.at n=35A104043
• Rectangular table, read by antidiagonals, such that the g.f. of row n, R_n(y), satisfies: R_n(y) = Sum_{k>=0} y^k * R_k(y)^(n*k) for n>=0, with R_0(y) = 1/(1-y).at n=63A124530
• Row 2 of rectangular table A124530.at n=8A124532
• Primes of the form 26k+1 generated recursively. Initial prime is 53. General term is a(n) = Min {p is prime; p divides (R^13 - 1)/(R - 1); p == 1 (mod 13)}, where Q is the product of previous terms in the sequence and R = 13*Q.at n=2A125037
• Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1100-1000-1111 pattern in any orientation.at n=11A146683
• Primes p such that all the digits needed to write the consecutive Primes from 2 to p fill exactly a square (no holes, no overlaps).at n=31A158024
• a(n) is the largest prime factor of (n-1)^n - n^(n-1).at n=12A174379
• a(n) is the smallest start of a run of exactly n consecutive primes such that the sum of the digits of each prime is composite.at n=9A241525
• The first prime of 8 consecutive primes a, b, c, d, e, f, g, h such that a + g = c + e and b + h = d + f.at n=25A292618
• Number of partitions of n into parts having the same number of distinct prime divisors as n.at n=61A300979
• Numbers b > 1 such that the smallest four primes, i.e., 2, 3, 5 and 7 are base-b Wieferich primes.at n=29A339533
• Largest cost for a permutation problem.at n=42A367185
• Primes such that x^16 = 2 has a solution in Z/pZ, but x^32 = 2 does not.at n=11A373468
• Prime numbersat n=2839