34080

Appears in sequences

• a(1) = 2; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=44A025003
• Strongly refactorable numbers: numbers n such that if n is divisible by d, it is divisible by the number of divisors of d.at n=37A141586
• Number of (n+2) X 4 0..1 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly three ways, and new values 0..1 introduced in row major order.at n=17A204375
• Triangle of coefficients of polynomials v(n,x) jointly generated with A208932; see the Formula section.at n=50A208932
• Number of (w,x,y) with all terms in {0,...,n} and w != max(|w-x|,|x-y|,|y-w|).at n=32A213498
• G.f. A(x) satisfies: A(x) = x * (1 + A(x) + A(x^2)^2 + A(x^3)^3 + ...).at n=52A332753
• a(n) is the number of preference profiles in the stable marriage problem with 3 men and 3 women that generate n possible stable matchings.at n=0A344666
• a(n) is the number of preference profiles in the stable marriage problem with n men and n women that generate exactly 1 possible stable matching.at n=2A344668
• a(n) is the number of binary strings of length n not containing the substrings 0000, 0001, 0011, 0111, 1111.at n=23A373080