24940

Appears in sequences

• a(n) = [ a(n-1)/a(1) + a(n-2)/a(2) + ... + a(1)/a(n-1) ], for n >= 3.at n=31A022869
• Number of degree-n irreducible polynomials over GF(2) with trace = 0 and subtrace = 0.at n=20A042980
• Number of degree-n irreducible polynomials over GF(2) with trace = 1 and subtrace = 0.at n=20A042981
• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=16A049921
• Triangle T(n,k) of coefficients of Meixner polynomials of degree n, k=0..n.at n=42A060338
• Triangle read by rows: T(n,k) = number of degree-n permutations with k odd cycles, k=0..n, n >= 0.at n=38A060524
• Number of binary Lyndon words of length n with trace 0 and subtrace 0 over Z_2.at n=20A074027
• Number of binary Lyndon words of length n with trace 1 and subtrace 0 over Z_2.at n=20A074029
• Column k=2 sequence (without zero entries) of table A060524.at n=3A103916
• Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k columns of odd length (0<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=64A121745
• Smallest k > 1 such that (sum of digits of k^n)*(sum of digits of k^(n+1)) = k, or 0 if no such k exists.at n=10A126783
• 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, -1, 0), (0, 1, -1), (0, 1, 1), (1, 0, 1), (1, 1, 0)}.at n=7A151195
• Number of n X 8 binary arrays with all 1s connected, a path of 1s from top row to lower right corner, and no 1 having more than two 1s adjacent.at n=3A163701
• Number of n X 4 binary arrays with all 1s connected, a path of 1s from left column to lower right corner, and no 1 having more than two 1s adjacent.at n=7A163706
• Number of integer partitions of n whose parts minus 1 are relatively prime.at n=38A328170
• Number of non-collinear triples in a 5 X n rectangular grid.at n=10A334707
• Number of compositions (ordered partitions) of n into at most 5 prime powers (including 1).at n=46A347775
• Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with all 1's connected, a path of 1's from top row to lower right corner, and no 1 having more than two 1's adjacent.at n=58A391823