25124

Appears in sequences

• n(k) is the minimum n that requires at least k to make 2*Prime[n]+Prime[k] a prime.at n=47A114234
• Euler transform of powers of 4.at n=6A144068
• Number A(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=61A144074
• a(n) = A000011(n) - A256216(n).at n=29A256217
• Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 3*x + 2.at n=17A257610
• Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 3*x + 2.at n=18A257610
• Numbers n such that Bernoulli number B_{n} has denominator 690.at n=41A272186
• Index of 2^n in A351495.at n=15A361334