4194307

Appears in sequences

• Numbers that are the sum of 4 positive 11th powers.at n=15A004815
• a(n) = 2^n + 3.at n=22A062709
• Positions of the elements of the quasicyclic group Z+(2a+1)/(2^b) [a > 0 and a < 2^(b-1), b > 0] at the ]0,1[ side of the Stern-Brocot Tree (A007305/A007306).at n=32A065674
• Least m such that B(n!) = B(n!+m), where B(n) is the sum of binary digits of n.at n=23A078610
• a(n) = n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=2.at n=17A088578
• First primitive GF(2)[X] polynomial of degree n.at n=21A132447
• First primitive GF(2)[X] polynomial of degree n with at most 5 terms.at n=21A132449
• First primitive GF(2)[X] polynomial of degree n and minimal number of terms.at n=21A132453
• a(n) = 3*a(n-1) - 3*a(n-2) + 2*a(n-3), with a(0) = a(1) = -1 and a(2) = 3.at n=22A135446
• Powers of 2 with 3 alternatingly added and subtracted.at n=22A140657
• Inverse binomial transform of A153130.at n=23A158916
• Numbers of the form 2^(p-1)+3, where p is prime.at n=8A229065
• Numbers of the form 2^k+3 or 3*2^k+1, k >= 2.at n=39A245179
• As a binary numeral, the bit 2^(m-1) of a(n) is 1 iff m is a proper divisor of n.at n=45A247146
• a(n) = 4^n + 3.at n=11A253208
• a(n) = n + 1 when n <= 3, otherwise a(n) = 2^(n-2) + 3; also iterates of A005187 starting from a(1) = 2.at n=23A256994
• a(n) = 2*a(n-1) - a(n-3) + 2*a(n-4) for n>3, a(0)=1, a(1)=-1, a(2)=4, a(3)=8.at n=22A274817
• a(0)=4; if n > 0 is even then a(n) = 2^(n/2+1)+3, otherwise a(n) = 3*(2^((n-1)/2)+1).at n=42A343177
• Lexicographically first irreducible polynomial over GF(2) of degree n, evaluated at X = 2.at n=21A344141
• Lexicographically first irreducible polynomial over GF(2) of degree n with the lowest possible number of terms, evaluated at X = 2.at n=21A344142