38635
domain: N
Appears in sequences
- Number of primes p between powers of 2, 2^n < p <= 2^(n+1).at n=19A036378
- Number of 3-noncrossing RNA structures, i.e., the number of 3-noncrossing partial matchings over n vertices and without arcs of length 1.at n=11A133365
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 0, 1), (0, -1, 0), (1, 0, 0), (1, 1, -1)}.at n=10A148616
- Triangle read by rows:e(n,k)=Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}]; t(n,m)=(e[n + 1, m]*PartitionsQ[n] + e[n + 1, n - m]*(PartitionsQ[ n - m] + PartitionsQ[m])) - 2.at n=30A156225
- Triangle read by rows:e(n,k)=Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}]; t(n,m)=(e[n + 1, m]*PartitionsQ[n] + e[n + 1, n - m]*(PartitionsQ[ n - m] + PartitionsQ[m])) - 2.at n=33A156225
- a(n) = the number of noncomposites (primes or 1) that are n digits long when written in binary.at n=19A162145
- Number of Ramanujan primes <= 2^n.at n=20A190502
- Numbers k such that the product of the first k primes minus the (k+1)-th prime is prime.at n=22A249798
- Number of (6+2)X(n+2) 0..4 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=10A252967
- Numbers n such that n!!-8 is prime.at n=27A259359
- Numbers n such that sigma(n) is a Fibonacci number.at n=29A272412
- Partial sums of A299285.at n=24A299286
- Number of nX4 0..1 arrays with every element unequal to 0, 1, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=12A304851
- Number of n-bit primes.at n=19A374403