1114129

Appears in sequences

• Sierpiński's triangle (Pascal's triangle mod 2) converted to decimal.at n=20A001317
• 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=20A004729
• 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=21A007755
• Numbers k such that k^3 is palindromic in base 16.at n=13A029735
• 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=10A038183
• Odd values of n for which a regular n-gon can be constructed by compass and straightedge.at n=19A045544
• a(n) = Xpower(n,5).at n=17A048734
• Smallest number whose Euler totient is divisible by 2^n.at n=20A053576
• 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=11A070816
• Basis for code in A075928.at n=14A075929
• Numbers k such that phi(k) is a perfect tenth power.at n=14A078170
• Numbers A001317 repeated.at n=40A087745
• Numbers A001317 repeated.at n=41A087745
• a(n) = A087745(n+1).at n=40A087756
• a(n) = A087745(n+1).at n=39A087756
• 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=21A098196
• Modulo 2 binomial transform of the Jacobsthal numbers J(n).at n=21A100745
• A modular binomial sum transform of 2^n.at n=41A101692
• A modular binomial sum transform of 2^n.at n=25A101692
• A modular binomial sum transform of 2^n.at n=27A101693