1572865

Appears in sequences

• a(0) = 1; thereafter a(n) = 3*2^(n-1) + 1.at n=20A004119
• a(n) = 3*n*2^(n-1) + 1.at n=16A048474
• a(n) = n*8^n + 1.at n=6A064746
• Values of n such that Sum[ -(-1)^(k) n/k (n-1)/(k+1),{k,1,n}] (n!!) is an integer.at n=38A078621
• a(n) = 3*2^floor((n-1)/2) + (-1)^n.at n=39A097581
• a(1) = 2, a(2) = 4; a(n) = 2*a(n-1) - 1.at n=20A103204
• Pierpont 3-almost primes. 3-almost primes of form (2^K)*(3^L)+1.at n=29A112797
• a(n) = n-th element of n-th row of triangle shown below.at n=24A115025
• a(n) = 1 + (n-6)*2^(n-1).at n=12A115342
• a(n) = 3*2^n + 1.at n=19A181565
• a(n) = 6*4^n + 1.at n=9A199116
• a(n) = 6*8^n+1.at n=6A199554
• a(n) = a(n-1) + 2*a(n-2) with n>1, a(0)=2, a(1)=7.at n=19A201630
• 1/4 the number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences.at n=39A209721
• Numbers of the form 2^k+3 or 3*2^k+1, k >= 2.at n=36A245179
• a(0) = 1, a(n+1) = 2*a(n) + periodic sequence of length 2: repeat [5, -4].at n=19A280173
• a(0) = 3, a(n+1) = 2*a(n) + periodic sequence of length 2: repeat [1, -2].at n=19A280345
• Minimum m such that the convergence speed of m^^m is equal to n >= 2, where A317905(n) represents the convergence speed of m^^m (and m = A067251(n), the n-th non-multiple of 10).at n=17A337392
• Number of subsets of {1..n} whose elements have the same number of distinct prime factors.at n=41A339512
• Indices where A354169 is the sum of two consecutive powers of 2.at n=36A354775