419430

Appears in sequences

• Expansion of 1/((1-2*x)*(1+x^2)).at n=19A007910
• Base 4 digits are, in order, the first n terms of the periodic sequence with initial period 1,2.at n=10A037481
• Number of integers in {1, 2, ..., 2^n} that are coprime to n.at n=19A074933
• Expansion of 1/((1-x)*(1-2*x)*(1+x^2)).at n=18A077854
• Expansion of (1-x)/(1-x+2*x^3).at n=39A078014
• Expansion of (1-x)/(1-x+2*x^3).at n=41A078014
• First occurrence (*2) of n in A088627 - or - least number that yields n different primes if you factorize it in all possible ways in two factors and add these factors.at n=28A091350
• a(n) = floor(A140657(n+2)/10).at n=20A140659
• Binary XOR of 2^k - (-1)^k as k varies from 1 to n.at n=19A199402
• Binary XOR of (2^k - (-1)^k)/3 as k varies from 1 to n.at n=19A199403
• Numbers n such that ror(n) + rol(n) is a power of 2, where ror(n)=A038572(n) is n rotated one binary place to the right, rol(n)=A006257(n) is n rotated one binary place to the left.at n=14A273180
• Values of bphi(k) = bphi(k+1), where bphi is the bi-unitary analog of Euler's totient function (A116550).at n=10A294030
• a(n) is the least positive number which yields a multiple of n when its binary digit string, S(n), is read in any numeric base; a(n) is displayed in base 10.at n=9A329000
• Numbers k such that k^(k + 1) == k + 1 (mod 2*k + 1) while 2*k+1 is not prime.at n=18A380831