2097155

Appears in sequences

• a(n) = 2^n + 3.at n=21A062709
• Triangle read by rows in which the n-th row contains n distinct numbers whose sum is n^n. The numbers are terms of an arithmetic progression with a common difference 1 or 2 respectively accordingly as n is odd or even.at n=33A080524
• a(n) = (2^(n-1) + prime(n+1)-prime(n))/2.at n=22A085431
• a(n) = -3a(n-1) - 3a(n-2) - 2a(n-3), n > 3.at n=22A158927
• a(n) = smallest number that leads to a new cycle under the base-8 Kaprekar map of A165090.at n=14A165107
• a(n) = 2*4^n + 3.at n=10A188161
• Numbers of the form 2^k+3 or 3*2^k+1, k >= 2.at n=37A245179
• a(n) = n + 1 when n <= 3, otherwise a(n) = 2^(n-2) + 3; also iterates of A005187 starting from a(1) = 2.at n=22A256994
• a(0)=4; if n > 0 is even then a(n) = 2^(n/2+1)+3, otherwise a(n) = 3*(2^((n-1)/2)+1).at n=40A343177
• a(n) = Sum_{d|n} d^(phi(n/d) - 1).at n=45A345268
• Number of minimal dominating sets in the n-book graph.at n=20A347512
• Array read by ascending antidiagonals: A(m, n) = Sum_{i=0..n} Sum_{d=0..n-i} binomial(n, d)*StirlingS2(n-d, i)*(m^(m-1) - 1)^(n-d-i).at n=30A364074