286331153

Appears in sequences

• Sierpiński's triangle (Pascal's triangle mod 2) converted to decimal.at n=28A001317
• Divisors of 2^32 - 1 (for a(1) to a(31), the 31 regular polygons with an odd number of sides constructible with ruler and compass).at n=28A004729
• Smallest number m such that the trajectory of m under iteration of Euler's totient function phi(n) [A000010] contains exactly n distinct numbers, including m and the fixed point.at n=29A007755
• Base-4 digits are, in order, the first n terms of the periodic sequence with initial period 1,0.at n=14A033114
• Sum of n-th powers of divisors of 128.at n=4A034674
• One-dimensional cellular automaton 'sigma-minus' (Rule 90): 000,001,010,011,100,101,110,111 -> 0,1,0,1,1,0,1,0.at n=14A038183
• Odd values of n for which a regular n-gon can be constructed by compass and straightedge.at n=27A045544
• Smallest number whose Euler totient is divisible by 2^n.at n=28A053576
• a(n) = n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1.at n=16A053717
• Number of integers in {1, 2, ..., 2^n} that are coprime to n.at n=29A074933
• Expansion of 1/((1-2*x)*(1-x^4)).at n=28A083593
• Smallest nonprime number which if used as initial term for iteration of the A000010[x] function, results in list-to-fixed-point of length=n, or 0 if no such number exists.at n=29A098196
• Modulo 2 binomial transform of the Jacobsthal numbers J(n).at n=29A100745
• A modular binomial sum transform of 2^n.at n=29A101692
• A modular binomial sum transform of 2^n.at n=31A101693
• a(0) = 0 and a(n) = (5*(-4)^n + 16*(-1)^n + 9*4^n)/240 for n >= 1.at n=17A113968
• Expansion of 1/((1+x)*(1-2*x)*(1+x^2)).at n=29A115451
• G.f. x^2*(-1+x+x^2)/((1-x)*(2*x-1)*(x+1)*(x^2+1)).at n=32A115851
• Decimal representation of n-th iteration of the Rule 54 elementary cellular automaton starting with a single black cell.at n=14A118108
• Partial sums of powers of 16.at n=7A131865