19612

Appears in sequences

• Numbers k such that 10*3^k + 1 is prime.at n=24A005539
• Number of Costas arrays of order n, counting rotations and flips as distinct.at n=14A008404
• Coordination sequence for MgZn2, Mg position.at n=35A009939
• Let r, s, t be three permutations of the set { 1, 2, 3, ..., n }; a(n) = minimal value of Sum_{i=1..n} r(i)*s(i)*t(i).at n=22A070735
• Shifts one place left under 9th-order binomial transform.at n=5A075508
• a(n) = (1/24)*(n+1)*(3*n^3+59*n^2+358*n+648).at n=16A090949
• Number of permutations of 1..n with all differences of elements separated by distances 1 through 7 being respectively unique.at n=14A170813
• Number of permutations of 1..n with all differences of elements separated by distances 1 through 8 being respectively unique.at n=14A170814
• Number of permutations of 1..n with all differences of elements separated by distances 1 through 9 being respectively unique.at n=14A170815
• Number of length n+4 0..8 arrays with no five consecutive elements with pattern ababa or abbba (possibly a=b) and new values 0..8 introduced in 0..8 order.at n=4A244183
• Number of length n+4 0..9 arrays with no five consecutive elements with pattern ababa or abbba (possibly a=b) and new values 0..9 introduced in 0..9 order.at n=4A244184
• a(n) is the smallest number k such that the difference between the next prime greater than k and k equals n.at n=48A309877