17895697

Appears in sequences

• a(n) = floor(2^(n-1)/n).at n=29A006788
• Sum of n-th powers of divisors of 64.at n=4A020516
• Triangle of Gaussian binomial coefficients [ n,k ] for q = 16.at n=29A022180
• Base-4 digits are, in order, the first n terms of the periodic sequence with initial period 1,0.at n=12A033114
• Duplicate of A020516.at n=4A034670
• a(n) = period of x^n + x + 1 over GF(2), i.e., the smallest integer m>0 such that x^n + x + 1 divides x^m + 1 over GF(2).at n=27A046932
• a(n) = 1111111 in base n.at n=15A053716
• Nearest integer to 2^(n-1)/n.at n=29A054650
• Numbers of the form (4^{mr}-1)/(4^r-1) for positive integers m, r.at n=34A076275
• Expansion of 1/((1-2*x)*(1-x^4)).at n=24A083593
• a(0) = 0 and a(n) = (5*(-4)^n + 16*(-1)^n + 9*4^n)/240 for n >= 1.at n=15A113968
• Expansion of 1/((1+x)*(1-2*x)*(1+x^2)).at n=25A115451
• G.f. x^2*(-1+x+x^2)/((1-x)*(2*x-1)*(x+1)*(x^2+1)).at n=28A115851
• Decimal representation of n-th iteration of the Rule 54 elementary cellular automaton starting with a single black cell.at n=12A118108
• Partial sums of powers of 16.at n=6A131865
• T(n,k) = (k^n)*U(n, (1/k + k)/2), where U(n,x) is the n-th Chebyshev polynomial of the second kind, square array read by antidiagonals upward (n >= 0, k >= 1).at n=48A173588
• Triangle generated by T(n,k) = q^k*T(n-1, k) + T(n-1, k-1), with q=4.at n=29A176244
• a(0)=0; a(n+1) = 2*a(n) + period 4:repeat 0,1,-2,1.at n=28A181586
• a(0)=0, a(1)=1, a(n) = least k>a(n-1) such that k+a(n-2) is a Jacobsthal number.at n=25A215095
• Decimal representation of the n-th iteration of the "Rule 147" elementary cellular automaton starting with a single ON (black) cell.at n=12A262862