28065

Appears in sequences

• Number of basic invariants for cyclic group of order and degree n.at n=23A002956
• a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ] and s = (Fibonacci numbers).at n=17A025078
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (F(2), F(3), F(4), ...).at n=16A025082
• Number of reversible strings with n beads using exactly three different colors.at n=9A056310
• Number of singular n X n rational {0,1}-matrices with no zero rows.at n=3A116506
• Numbers k such that 7^k + 2 is semiprime.at n=23A119720
• a(n) = numerator of the continued fraction which has the positive integers which are <= n and are coprime to n as its terms.at n=13A127614
• Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1111-1111 pattern in any orientation.at n=12A146934
• Hilltop maps: number of n X 1 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..3 n X 1 array.at n=14A218189
• Half-cumulants of a Fibonacci-geometric probability distribution.at n=5A302927
• Triangle read by rows: T(n,k) is the number of rows of n colors with exactly k different colors counting chiral pairs as equivalent, i.e., the rows are reversible.at n=47A305621
• Irregular table read by rows: T(n,k) is the number of permutations in S_n that have exactly k occurrences of the pattern 2413. 0 <= k <= A342854(n).at n=45A342860
• a(n) is the number of ways to partition an n X n X n cube into 4 noncongruent cuboids.at n=30A384311
• a(n) is the number of ways to partition an n X n X n cube into four noncongruent cuboids of different volumes.at n=30A385580
• a(n) is the least number k such that j * n! + 1 is prime for all j from k to k + n - 1.at n=5A392534