130886

Appears in sequences

• a(n) = floor(n*phi^19), where phi is the golden ratio, A001622.at n=14A004934
• a(n) = round(n*phi^19), where phi is the golden ratio, A001622.at n=14A004954
• Consider the 2^(n-1)-1 nonempty subsets S of {1, 2, ..., n-1}; a(n) gives number of such S for which it is impossible to partition n into parts from S such that each s in S is used at least once.at n=17A070880
• Number of nX4 binary arrays with every 1 immediately preceded by 0 0 to the left or above.at n=6A203104
• Number of n X 7 binary arrays with every 1 immediately preceded by 0 0 to the left or above.at n=3A203107
• T(n,k)=Number of nXk binary arrays with every 1 immediately preceded by 0 0 to the left or above.at n=48A203108
• T(n,k)=Number of nXk binary arrays with every 1 immediately preceded by 0 0 to the left or above.at n=51A203108