21195

Appears in sequences

• Numbers n such that n through n+5 have the same number of distinct prime factors.at n=24A045934
• Numbers n such that n through n+6 are divisible by the same number of distinct primes.at n=10A045935
• a(n) = n^3 - n^2 + n - 1 = (n-1) * (n^2 + 1).at n=28A062158
• G.f.: A(x) = (A_1)^3 where A_1 = 1 + x*(A_2)^3; A_2 = 1 + x^2*(A_3)^3; A_3 = 1 + x^3*(A_4)^3; ... A_n = 1 + x^n*(A_{n+1})^3 for n>=1.at n=17A132331
• Exponential Riordan array (e^(x), x*A000108(x)).at n=23A185946
• Deficient numbers n having a companion m > n such that sigma(n)/n = sigma(m)/m.at n=37A212608
• Number of ways to reciprocally link elements of an n X 3 array either to themselves or to exactly two king-move neighbors, without consecutive collinear links.at n=4A220714
• Number of ways to reciprocally link elements of an nX5 array either to themselves or to exactly two king-move neighbors, without consecutive collinear links.at n=2A220716
• T(n,k)=Number of ways to reciprocally link elements of an nXk array either to themselves or to exactly two king-move neighbors, without consecutive collinear links.at n=23A220718
• T(n,k)=Number of ways to reciprocally link elements of an nXk array either to themselves or to exactly two king-move neighbors, without consecutive collinear links.at n=25A220718
• Number of partitions of n having an ordering of parts in which no parts of equal parity are adjacent and the first and last terms have the same parity.at n=49A239833
• On a diagonally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped when moving to the lowest available unvisited square, or -1 if it never gets trapped.at n=40A352730