119304647

Appears in sequences

• a(n) = ceiling(24(2^n-1)/n).at n=26A003177
• Positions of remoteness 2 in Beans-Don't-Talk.at n=16A005698
• a(n) = 7*a(n-1) + 8*a(n-2), a(0) = 0, a(1) = 1.at n=10A015565
• Base-4 digits are, in order, the first n terms of the periodic sequence with initial period 1,3,0.at n=13A037597
• Number of points of period n under the dual of the map x->2x on Z[1/6].at n=29A059990
• Squarefree part of 2^n-1 : the smallest number such that a(n)*(2^n-1) is a square.at n=29A069112
• Duplicate of A015565.at n=10A082310
• Expansion of x^3/(1 - 2*x + x^3 - 2*x^4) = x^3/( (1-2*x)*(1+x)*(1-x+x^2) ).at n=30A113405
• a(n) = a(n-1) + 2^A047240(n) for n>1, a(1)=1.at n=14A113841
• First differences of A131666.at n=30A131090
• First differences of (A113405 prefixed with a 0).at n=30A131666
• a(0)=1. a(n+1)=2*a(n)-A130151(n).at n=29A132780
• a(n) = 3 A113405(n)- A113405(n+1).at n=30A133511
• Inverse binomial transform of A131666 after removing A131666(0) = 0.at n=29A135258
• a(n) = 3*A131666(n) - A131666(n+1).at n=30A135259
• Numbers such that every run length in base 2 is 3.at n=8A152776
• a(n) = floor(2^n/9).at n=30A153234
• Number of nonzero elements in GF(2^n) that are 9th powers.at n=29A213246
• a(n) = p(0,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(2) as in A327320.at n=29A329005
• a(n) = p(1,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(2) as in A327320.at n=14A329006