21968

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = (odd natural numbers).at n=22A024473
• Cube root of A030683.at n=22A030684
• Number of (n+1) X 4 binary arrays with every 2 X 2 subblock singular.at n=3A184680
• Number of (n+1) X 5 binary arrays with every 2 X 2 subblock singular.at n=2A184681
• T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock singular.at n=17A184686
• T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock singular.at n=18A184686
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k nonincreasing odd cycles (0<=k<=floor(n/3)). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be odd if it has an odd number of entries. For example, the permutation (152)(347)(6)(8) has 1 nonincreasing odd cycle.at n=15A186766
• Number of permutations of {1,2,...,n} having no nonincreasing odd cycles. A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be odd if it has an odd number of entries.at n=8A186767
• Expansion of Product_{k>=1} ((1 - 4^k*x^k)/(1 + 4^k*x^k))^(1/4^k).at n=10A303490
• Number of distinct circles that can be constructed from an n x n square grid of points using only a compass.at n=14A359931