131055

Appears in sequences

• a(n) = 2^n - n.at n=17A000325
• a(n) = 2^(2*n+1)*Sum_{k=1..2*n} binomial(2*n+1,k)*Bernoulli(k)/2^k.at n=7A069993
• a(n) = ceiling(n^(1/n))^n - n.at n=16A076878
• a(n) = 3*a(n-1) - a(n-2) - 3*a(n-3) + 2*a(n-4).at n=16A084173
• a(n) = 2^prime(n)-prime(n).at n=6A100105
• Numbers that contain a single zero in bases 2 and 10.at n=37A118681
• Double, add 0, double, add 1, double, add 2, double, add 3, etc.at n=32A147678
• Fixed points of the mapping f(x) = (x + 2^x) mod (17 + x).at n=12A166118
• Smallest integer m > 1 such that m!^(m + n) divides (m^2)!.at n=14A244443
• Where the difference A055938(n) - A005187(n) obtains record values; positions of records in A257126.at n=27A257130
• a(n) = Numerator of (0 followed by 1's) - n/2^n.at n=17A273153
• Number of nX2 0..1 arrays with every element equal to 0, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=16A297937