27004
domain: N
Appears in sequences
- Number of products of distinct primes <= p(n) equal to 1 (mod p(n)).at n=21A024405
- Numbers k such that sopfr(k) = sopfr(k + sopfr(k)).at n=27A050780
- Number of chess games that end in check (but not checkmate) after exactly n plies.at n=5A089956
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 01110-11111 pattern in any orientation.at n=10A147361
- Numbers n such that the binary expansion of n starts with the base 3 expansion of n.at n=12A178679
- Numbers n such that the binary expansion of n contains the base 3 expansion of n as a substring.at n=14A178680
- Numbers that have 10 terms in their Zeckendorf representation.at n=24A179250
- Number of length 1+3 0..n arrays with every four consecutive terms having the sum of some three elements equal to three times the fourth.at n=26A248538
- Least positive integer n having only the digits 0 or 1 in base 3, such that the product with A263488(n) also has only digits 0 or 1 in base 3.at n=76A265143
- a(n) = n^3 + 4.at n=30A274077
- Number of 2Xn 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=13A280400
- a(n) = (5/128)*n^4*(n mod 2) + (((-5/128)*n^4*(n mod 2) - 26) mod n) + n^3 (n > 0).at n=29A294264
- Numbers k such that (16*10^k + 107)/3 is prime.at n=19A295522
- Number of n X 2 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1 or 2 neighboring 1s.at n=8A296380
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1 or 2 neighboring 1s.at n=46A296386
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1, 2 or 4 neighboring 1s.at n=46A296643
- Number of length-n binary words that can be written as the concatenation of two unbordered binary words.at n=14A306742
- Number of excursions of length n with Motzkin-steps avoiding the consecutive steps UH, HH, HD and DU.at n=25A329693