32765

Appears in sequences

• a(n) = 2^n - 3.at n=15A036563
• Numbers having four 7's in base 8.at n=33A043452
• New record highs reached in A060030.at n=27A060482
• Smallest number having in binary representation a prefix of length n that is also a suffix of its successor.at n=14A091270
• a(n) = 1 + sum{p=primes<n, p does not divide n} a(p).at n=47A112479
• Semiprime nearest to 2^n. (In case of a tie, choose the smaller).at n=15A117405
• Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 2-cell columns starting at level 0 (n >= 1; 0 <= k <= n-1).at n=50A121634
• Moebius transform of A037019.at n=38A130113
• a(n) = 3*a(n-1) - 3*a(n-2) + 2*a(n-3), with a(0) = 4, a(1) = 2, a(2) = 1.at n=15A133455
• a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3).at n=26A136252
• Powers of 2 with 3 alternatingly added and subtracted.at n=15A140657
• a(n) = 2^n +(-1)^n - 2.at n=15A166956
• a(n) = ADPE(n) is the total number of aperiodic k-double-palindromes of n up to cyclic equivalence, where 1 <= k <= n.at n=28A181314
• Expansion of (1+2x)*(1+2*x^2)/((1-x)*(1+x)*(1-2*x^2)).at n=26A185647
• Largest k such that (2^n-k)*2^n-k is a prime number.at n=13A191013
• Monotonic ordering of nonnegative differences 8^i-3^j, for 40>= i>=0, j>=0.at n=29A192156
• Partial sums of A173862.at n=39A200672
• Fibonacci 14-step numbers, a(n) = a(n-1) + a(n-2) + ... + a(n-14).at n=16A220469
• 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=24A226618
• Fundamental discriminants d uniquely characterizing all complex biquadratic fields Q(sqrt(-3),sqrt(d)) which have 3-class group of type (3,3) and second 3-class group isomorphic to either SmallGroup(2187,247)-#1;5 or SmallGroup(2187,247)-#1;9.at n=9A250242