35530

Appears in sequences

• a(n) = floor( binomial(n,8)/9).at n=22A011845
• Number of necklaces with 9 black beads and n-9 white beads.at n=14A032194
• T(2n+5,n), array T as in A051168; a count of Lyndon words.at n=9A050183
• a(n) = ceiling(binomial(n,9)/n).at n=22A053733
• a(n) = binomial(prime(n),n)/prime(n) where prime(n) = n-th prime.at n=8A075872
• Squarefree numbers of the form (prime(k)+1)*(prime(k+1)+1)/4.at n=15A079095
• Binomial(prime(n),s)/prime(n) where s is the sum of the decimal digits of n.at n=8A176266
• Coefficients of the generalized continued fraction expansion sqrt(7) = a(1) +a(1)/(a(2) +a(2)/(a(3) +a(3)/(a(4) +a(4)/....))).at n=11A233587
• Numbers m such that each of p=6*m+1, q=6*p+1, r=6*q+1 and s=6*r+1 is prime.at n=35A263311
• Number of aperiodic necklaces (Lyndon words) with 9 black beads and n white beads.at n=14A263318
• Numbers k such that the least j >= k for which k and A276086(j) are coprime is a nontrivial multiple of k, where A276086 is the primorial base exp-function.at n=53A356318
• Numbers k such that the sum of the proper divisors of k that have the same binary weight as k is larger than k, and no subset of these divisors sums to k.at n=18A381071
• Number of subsets of 9 integers between 1 and n such that their sum is 3 modulo n.at n=13A381351