38713

Properties

Appears in sequences

• Josephus problem: numbers m such that, when m people are arranged on a circle and numbered 1 through m, the final survivor when we remove every 4th person is one of the first three people.at n=31A005427
• Number of rooted trees with n nodes and 5 leaves.at n=11A055280
• Number of ways writing n! as a sum of two primes.at n=10A062311
• a(1) = 1 and a(n) = ceiling((Sum_{k=1..n-1} a(k))/3) for n >= 2.at n=39A072493
• Primes of the form 5n^2 - 7.at n=18A201788
• Number of (n+1)X(6+1) 0..3 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..3 introduced in row major order.at n=2A231449
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..3 introduced in row major order.at n=30A231451
• Number of (3+1)X(n+1) 0..3 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..3 introduced in row major order.at n=5A231453
• Primes p such that (p^512 + 1)/2 is prime.at n=7A341264
• a(n) = Sum_{k=0..floor(n/4)} (-1)^k * binomial(n-3*k,k) * Catalan(k).at n=31A360026
• The numbers of people such that, in the variant of the Josephus problem in which three people are skipped and then one is eliminated, the first person is the last to be eliminated.at n=13A385327
• Prime numbersat n=4080