186369

Appears in sequences

• a(n) is the smallest k such that number of non-unitary prime divisors of central binomial coefficient, A001405(k) = C(k, floor(k/2)) equals n.at n=44A081394
• Triangle read by rows: T(n, k) = 2^n*(q^k - 1)*(q^(n - k) - 1) + 1, where q = 3.at n=29A176794
• Triangle read by rows: T(n, k) = 2^n*(q^k - 1)*(q^(n - k) - 1) + 1, where q = 3.at n=34A176794
• Number of -n..n arrays of 4 elements with first and second differences also in -n..n.at n=13A201089