27306

Appears in sequences

• a(n) = (5*4^n - 2)/3.at n=7A020989
• Numbers whose base-2 representation has exactly 14 runs.at n=14A043581
• Initial pile sizes that guarantee a win for player 2 in a variant of Fibonacci Nim where the players may not take one stone.at n=43A052492
• Grundy function for turn-at-most-8-coins game.at n=19A054045
• Number of 132 and 213-avoiding derangements of {1,2,...,n}.at n=16A061547
• Positions of check bits in code in A075943.at n=4A075945
• Numbers k such that A081252(m)/m^2 has a local maximum for m = k.at n=14A081254
• a(n) = (5*2^n + (-1)^n - 3)/3.at n=14A084170
• Inverse binomial transform of a math magic problem.at n=15A084214
• a(n) is the smallest number such that the exponent of p=2 factor in 6*a(n)+4 equals n.at n=14A087231
• Numbers k such that 6*k+5, 6*k+11, 6*k+17, 6*k+23 are consecutive primes.at n=25A090836
• Square array of numbers read by antidiagonals where T(n,k) = ((k+3)*(k+2)^n-2)/(k+1).at n=52A090842
• Numbers n such that 4*10^n + 8*R_n - 5 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=15A102998
• Triangular array read by rows: T(n,1) = T(n,n) = 1, T(n,k) = 4*T(n-1, k-1) + 2*T(n-1, k).at n=43A119726
• a(n) = 2*a(n-1) + a(n-2) - 2*a(n-3).at n=14A140359
• a(1)=2, a(2)=4, a(3)=6; a(n+3) = a(n+2)+ 2*a(n), n>=1.at n=14A151794
• a(n) = (10*2^n + 2*(-1)^n)/3 for n > 0; a(0) = 1.at n=13A168648
• a(n) = 2^(n-1) - (2^n*(-1)^n + 2)/3.at n=14A176965
• Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=17A192957
• 41 times triangular numbers.at n=36A195038