89911

Appears in sequences

• a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 5) so far).at n=37A060732
• A Jacobi transform of 10^n.at n=5A110252
• Numbers k such that binomial(5k, k) + 1 is prime.at n=20A125243
• 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=1A212229
• 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=16A212232
• Number of 0..2 arrays of length 1+2*n with sum no more than 2*n in any length 2n subsequence (=50% duty cycle).at n=4A212234