34001

Appears in sequences

• T(n,0) + T(n,1) + ... + T(n,n), T given by A027907.at n=10A027914
• Numbers k such that 2^k + 5 is prime.at n=12A059242
• Numbers k such that sigma(phi(sigma(k))) = phi(sigma(phi(k))).at n=21A067160
• Number of 0..2 arrays of length n+9 with sum no more than 10 in any length 10 subsequence (=50% duty cycle).at n=0A212229
• T(n,k)=Number of 0..2 arrays of length n+2*k-1 with sum no more than 2*k in any length 2k subsequence (=50% duty cycle).at n=10A212232
• Number of 0..2 arrays of length 2*n with sum no more than 2*n in any length 2n subsequence (=50% duty cycle).at n=4A212233
• Numbers k such that 3^k + 10 is prime.at n=28A217137
• Sum of largest parts of all partitions of n into an even number of parts.at n=31A222048
• Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=4A305765
• Number of nX5 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=3A305766
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=31A305769
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=32A305769