93308

Appears in sequences

• Number of 0..3 arrays of length n+5 with sum no more than 9 in any length 6 subsequence (=50% duty cycle).at n=3A212466
• T(n,k)=Number of 0..3 arrays of length n+2*k-1 with sum no more than 3*k in any length 2k subsequence (=50% duty cycle).at n=18A212471
• Number of 0..3 arrays of length 2*n+3 with sum no more than 3*n in any length 2n subsequence (=50% duty cycle).at n=2A212475
• T(n,k)=Number of length n+5 0..k arrays with no consecutive six elements summing to more than 3*k.at n=18A242144
• Number of length 4+5 0..n arrays with no consecutive six elements summing to more than 3*n.at n=2A242148
• a(n) is the least positive number k such that n is the greatest m such that k is a quadratic nonresidue mod prime(i+1) for i=1..m and {k mod prime(i+1): i=1..m} are all distinct.at n=11A385051