131069

Appears in sequences

• Special connected numbers: minimal and maximal connected numbers (cf. A029827) of a given binary order, i.e., between two consecutive powers of 2.at n=25A036379
• a(n) = 2^n - 3.at n=17A036563
• Numerators of continued fraction convergents to sqrt(52).at n=9A041088
• Numerators of continued fraction convergents to sqrt(208).at n=9A041386
• Numerators of continued fraction convergents to sqrt(832).at n=9A042606
• New record highs reached in A060030.at n=31A060482
• Smallest number having in binary representation a prefix of length n that is also a suffix of its successor.at n=16A091270
• a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3).at n=30A136252
• Powers of 2 with 3 alternatingly added and subtracted.at n=17A140657
• a(n) = -3a(n-1) - 3a(n-2) - 2a(n-3), n > 3.at n=18A158927
• Numbers of the form q-p, where p and q are prime and q = p^0+p^1+p^2+..+p^k for some k.at n=22A166388
• a(n) = 2^n +(-1)^n - 2.at n=17A166956
• Expansion of (1+2x)*(1+2*x^2)/((1-x)*(1+x)*(1-2*x^2)).at n=30A185647
• Largest k such that (2^n-k)*2^n-k is a prime number.at n=15A191013
• Partial sums of A173862.at n=45A200672
• Smallest positive integer k for which 1 is in a primitive cycle of n positive integers (n>1) under iteration by the Collatz-like 3x+k function.at n=15A226616
• Irregular array read by rows in which row n lists the positive integers k in ascending order for which 1 is in a primitive cycle of n positive integers under iteration by the Collatz-like 3x+k function.at n=29A226618
• 2^p - 3 where p is prime.at n=6A241676
• Fibonacci 16-step numbers, a(n) = a(n-1) + a(n-2) + ... + a(n-16).at n=18A249169
• a(n) = -1 + 2 * product_{i=0..n} A093179(i), where A093179(i) is the smallest prime factor of 2^(2^i) + 1.at n=3A259534