41943041

Appears in sequences

• a(n) = (n-1)*2^n + 1.at n=21A000337
• Using Euler's 6-term sequence A014556, we define the partial recurrence relation a(0)=2, a(1)=3, a(2)=5; a(k) = 2*a(k-1) - 1 - (-2)^(k-2), 3 <= k <= 5.at n=25A082605
• a(0) = 6; for n>0, a(n) = 2*a(n-1) - 1.at n=23A083575
• a(n) = Sum{i=1..n} ( i*2^(i-1) ) - ( A002024(n)*(A002024(n)+1)/2 - n ) * 2^(A002024(n)-1).at n=20A135471
• Greatest integer equal to the sum of the n-th powers of its base-3 digits (written in base 10).at n=22A162218
• a(n) = 10*4^n+1.at n=11A199209
• Clique covering number of the n-Sierpinski tetrahedron graph.at n=13A307702
• a(n) = 5*2^n - (-1)^n.at n=23A321643
• a(n) = Sum_{d|n} d^n * binomial(n/d-1,d-1).at n=21A376019