68719476735
domain: N
Appears in sequences
- Generalized Euler phi function (for p=2).at n=36A003473
- a(n) = 4^n - 1.at n=18A024036
- a(n) = 8^n - 1.at n=12A024088
- a(n) = n*4^n - 1, with a(0) = 1.at n=16A060416
- Jacobsthal gap sequence.at n=36A080924
- a(n) = (n+1) * 2^n - 1.at n=31A087323
- a(n) = 2^(prime(n) - 1) - 1 where prime(n) is the n-th prime.at n=11A098102
- Number of compositions of n into parts all relatively prime to n.at n=37A100347
- a(n) = 2^phi(n) - 1 = A066781(n) - 1.at n=36A100371
- a(n) = 0^n + 4^n - 1.at n=18A103454
- Mersenne numbers for which the product of the digits is not zero.at n=24A117060
- a(n) = n^12 - 1.at n=7A123868
- a(n) = (2^0)*(2^1)*(2^2)*(2^3)...(2^n)-1 = 2^T(n) - 1 where T(n) = A000217(n) is the n-th triangular number.at n=8A126883
- Moebius transform of A037019.at n=36A130113
- (2^(2p - 1)/2)-1, where p is prime.at n=7A139289
- Expansion of x*(4+5*x)/( (1-4*x)*(1 + x + x^2) ).at n=18A191272
- a(n) = 2^(k-1)-2^(j-1), where (2^(k-1),2^(j-1)) is the least pair of distinct positive powers of 2 for which n divides 2^(k-1)-2^(j-1).at n=36A204983
- (1/2)*(A204991).at n=36A204990
- a(n) = 2^(n^2) - 1.at n=6A212739
- Number of nonzero elements in GF(2^n) that are 11th powers.at n=35A213247