3407872

Appears in sequences

• a(n) = 13*2^n.at n=18A005029
• First differences of A045891.at n=21A034007
• 19-almost primes (generalization of semiprimes).at n=12A069280
• Let x(1)=1, x(n+1) = (4/3)*x(n) - floor((4/3)*x(n)); then a(n)=x(n)*3^n.at n=13A073533
• Denominators of Pi-independent part of even terms in the probability of obtaining an acute triangle by picking n points at random in the unit n-ball.at n=8A093759
• Numbers of the form (8^i)*(13^j), with i, j >= 0.at n=28A107764
• Second differences of A045623, prefixed by an initial 1.at n=20A109975
• G.f.: A(x) = Sum_{n>=0} (2*n+1) * 8^n * x^(n*(n+1)/2).at n=21A111983
• a(1) = 1. For n >=2, a(n) = the smallest integer > a(n-1) such that both a(n) and a(n)-a(n-1) have the same number of (non-leading) 0's when they are represented in binary.at n=39A160825
• Inverse binomial transform of A143025, assuming offset zero there.at n=20A173435
• Numbers with 38 divisors.at n=4A175747
• a(0)=2, a(1)=7, and a(n) = (3*n+1)*2^(n-1) if n > 1.at n=17A176662
• a(n) = n*(n-3)*2^(n-2).at n=16A178987
• a(n) = (2n+1)*8^n.at n=6A199301
• Number of (n+1) X (n+1) 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.at n=15A205186
• Row sums of A146565.at n=22A259098
• Triangle for denominators of coefficients for integrated odd powers of cos(x) in terms sin((2*m+1)*x).at n=51A273172
• Positions of zeros in A346246.at n=9A346251
• a(n) is the number of exterior top arches (no covering arch) for semi-meanders in generation n+1 that are generated by semi-meanders with n top arches and floor((n+2)/2) exterior top arches using the exterior arch splitting algorithm.at n=32A365679