19016

Appears in sequences

• Number of partitions satisfying (cn(0,5) = 0 and cn(2,5) <= cn(1,5) and cn(3,5) <= cn(1,5) and cn(2,5) <= cn(4,5) and cn(3,5) <= cn(4,5)).at n=51A036806
• Table of number of domino tilings of generalized Aztec pillows of type (1, ..., 1, 3, 1, ..., 1)_n.at n=48A112830
• Number of 0..11 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1.at n=3A171317
• Number of 0..n-1 integer arrays v[1..4] of length 4 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..3.at n=11A171355
• 1/8192 the number of (n+2)X4 0..3 arrays with each 3X3 subblock trace equal to some horizontal or vertical neighbor 3X3 subblock trace.at n=1A186548
• T(n,k)=1/8192 the number of (n+2)X(k+2) 0..3 arrays with each 3X3 subblock trace equal to some horizontal or vertical neighbor 3X3 subblock trace.at n=4A186553
• Number of days after Jan 01 1000 such that the date written in the format DDMMYYYY is palindromic.at n=18A210885
• First appearance of n in A016014, or 0 if n never occurs.at n=30A239800
• Cyclops numbers whose squares are cyclops numbers.at n=34A239827
• a(n) = permanent M_n where M_n is the n X n matrix m(i,j) = (i+j)^2.at n=3A278845