1864135

Appears in sequences

• Positions of remoteness 2 in Beans-Don't-Talk.at n=12A005698
• a(n) = 7*a(n-1) + 8*a(n-2), a(0) = 0, a(1) = 1.at n=8A015565
• Base-4 digits are, in order, the first n terms of the periodic sequence with initial period 1,3,0.at n=10A037597
• a(n) = floor(8^8/n).at n=8A057070
• Number of points of period n under the dual of the map x->2x on Z[1/6].at n=23A059990
• Squarefree part of 2^n-1 : the smallest number such that a(n)*(2^n-1) is a square.at n=23A069112
• List of codewords in binary lexicode with Hamming distance 12 written as decimal numbers.at n=4A075952
• Basis for code in A075952.at n=2A075953
• Positions of check bits in code in A075955.at n=2A075957
• a(n) = (n^n-(-1)^n)/(n+1).at n=8A081216
• Duplicate of A015565.at n=8A082310
• 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=24A113405
• a(n) = a(n-1) + 2^A047240(n) for n>1, a(1)=1.at n=11A113841
• a(n) = (n/3 + 7/9)*2^(n - 1) + (-1)^n/9.at n=18A127984
• First differences of A131666.at n=24A131090
• First differences of (A113405 prefixed with a 0).at n=24A131666
• a(0)=1. a(n+1)=2*a(n)-A130151(n).at n=23A132780
• a(n) = 3 A113405(n)- A113405(n+1).at n=24A133511
• Inverse binomial transform of A131666 after removing A131666(0) = 0.at n=23A135258
• a(n) = 3*A131666(n) - A131666(n+1).at n=24A135259