25367

Properties

Appears in sequences

• Primes p from A031924 such that A052180(p) = 23.at n=21A052238
• Records in A066674.at n=20A125879
• Smallest of 3 consecutive prime numbers such that p1*p2*p3*d1*d2=average of twin prime pairs; p1,p2,p3 consecutive prime numbers; d1(delta)=p2-p1, d2(delta)=p3-p2.at n=20A153409
• Number of planar n X n X n binary triangular grids symmetric under 120 degree rotation with no more than 1 one in any 5 X 5 X 5 subtriangle.at n=23A153905
• Primes expressed as the sum of square of digits of all primes.at n=32A181508
• Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..6 array extended with zeros and convolved with 1,2,2,1.at n=21A222109
• Record values in A061026, the smallest number m such that n divides phi(m), where phi is Euler's totient function.at n=22A233517
• Number of partitions p of n such that the multiplicity of (min(p) + max(p))/2 is a part.at n=49A240497
• a(n) = smallest prime p such that (smallest prime > p^2) == p^2 + 4n^2, n>=1.at n=4A276556
• a(n) = k if the last Dyck path that is counted in A279286(n) is the k-th Dyck path.at n=17A282198
• a(n) is the total number of down steps between the second and third up steps in all 2_1-Dyck paths of length 3*n. A 2_1-Dyck path is a lattice path with steps (1, 2), (1, -1) that starts and ends at y = 0 and stays above the line y = -1.at n=7A334643
• Number of integer partitions of n that are not pairwise coprime, where a singleton is not coprime unless it is (1).at n=38A335240
• Triangle read by rows: T(n,k) is the numerator of the probability of winning a 1-player game M(n,k) as defined below while playing optimally.at n=40A370398
• Prime numbersat n=2798