25703

Properties

Appears in sequences

• Number of forests of rooted trees of nonempty sets with n points. (Each node is a set of 1 or more points.)at n=10A052855
• a(n) = 4*a(n-1) - a(n-2) + 3, with a(0) = -1, a(1) = 1.at n=8A082840
• Row sums of A095167.at n=35A095170
• Smallest prime p such that the maximum run length of consecutive positive quadratic residues modulo p is n.at n=20A097159
• Prime numbers whose digit reversal is a powerful(1) number (A001694).at n=26A115685
• Primes p that divide Fibonacci[(p+1)/7].at n=31A125252
• Father primes of order 8.at n=38A136077
• a(n) is n-th prime == -1 (mod 6n).at n=35A138905
• Primes p == 3 mod 4 whose index as prime divides their index as a Gaussian prime (in the first quadrant, as defined in A103431, for example).at n=3A190637
• Primes p such that both (p^2 + 5)/6 and (p^4 + 5)/6 are prime.at n=20A253925
• Primes p such that A001175(p) = 2*(p+1)/7.at n=26A308785
• Inert rational primes in the intersection of all Q(sqrt(-d)) where d is a Heegner number.at n=5A309024
• Number of integer partitions of n whose run-sums are not weakly increasing.at n=38A357865
• a(n) is the least prime > a(n-2) such that a(n-1)+a(n) is a square.at n=28A359582
• Antidiagonal-sums of the array A377033(n,k) = n-th term of the k-th differences of the composite numbers (A002808).at n=19A377034
• Prime numbersat n=2831