29240

Appears in sequences

• Numbers k such that 45*2^k+1 is prime.at n=24A032372
• Numbers k whose decimal representation, read as a base-18 value and divided by k, yields an integer.at n=34A032567
• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 2.at n=14A049955
• a(n) is the least number x such that gcd(sigma(x), sigma(x+1)) = n.at n=32A084307
• Chebyshev polynomials S(n,171).at n=2A097844
• a(n) = 4*(3*n+1)*(3*n+2).at n=28A144410
• Eight times hexagonal numbers: a(n) = 8*n*(2*n-1).at n=43A152750
• a(n) = (n-1)*(n+2)*(n^2 + n + 2)/4.at n=17A168566
• For positive n with prime decomposition n = Product_{j=1..m} (p_j^k_j) define A_n = Sum_{j=1..m} (p_j*k_j) and B_n = Sum_{j=1..m} (p_j^k_j). This sequence gives those n for which A_n and B_n are both prime and B_n = A_n + 2 (i.e., form a twin prime pair).at n=52A185718
• Convolution of natural numbers (A000027) with tetradecagonal numbers (A051866).at n=15A220212
• The total number of rectangles appearing in the Thue-Morse sequence logical matrices after n stages.at n=9A241684
• The total number of rectangles appearing in the Thue-Morse sequence logical matrices (1, 0 version) after n stages.at n=9A241893
• a(n+3) = 2*a(n+2) + a(n+1) + a(n) with a(0)=3, a(1)=2, a(2)=6.at n=11A276225
• a(n) = n^4 + 4*n^2 + 3.at n=13A304726
• Numbers k such that k, k+1, k+2 and k+3 are all sums of a positive square and a positive cube.at n=5A329807
• a(n) = (n - 1)*n*(2*n^2 + 4*n - 1)/6.at n=17A330700
• G.f. A(x) satisfies: A(x) = (1 + x*A(x))*(1 + 2*x*A(x))*(1 + 3*x*A(x)) / (1 - x*A(x))^3.at n=4A341964
• The number of domino stacks with n dominos.at n=18A390209