327685

Appears in sequences

• Sierpiński's triangle (Pascal's triangle mod 2) converted to decimal.at n=18A001317
• 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=18A004729
• 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=9A038183
• Odd values of n for which a regular n-gon can be constructed by compass and straightedge.at n=17A045544
• Smallest number whose Euler totient is divisible by 2^n.at n=18A053576
• Solutions to phi(gpf(x)) - gpf(phi(x)) = 65534 = c are special multiples of 65537, x=65537*k, where the largest prime factors of factor k were observed in {2, 3, 5, 17, 257}.at n=4A070816
• Basis for code in A075928.at n=12A075929
• Numbers k such that phi(k) is a perfect 9th power.at n=13A078169
• Numbers A001317 repeated.at n=36A087745
• Numbers A001317 repeated.at n=37A087745
• a(n) = A087745(n+1).at n=35A087756
• a(n) = A087745(n+1).at n=36A087756
• Squarefree products of factors of Fermat numbers (A023394).at n=30A094358
• Modulo 2 binomial transform of the Jacobsthal numbers J(n).at n=19A100745
• A modular binomial sum transform of 2^n.at n=24A101692
• A modular binomial sum transform of 2^n.at n=40A101692
• A modular binomial sum transform of 2^n.at n=26A101693
• A modular binomial sum transform of 2^n.at n=42A101693
• a(n) is the smallest number m greater than 1 such that phi(m) = d(m)^n, where d(m) is number of positive divisors of m; if there is no such m, a(n)=1.at n=8A107655
• Trisection of A001317.at n=6A177882