65533

Appears in sequences

• a(n) = Sum_{k=0..n} T(n,k)*T(n,2n-k), T given by A027960.at n=9A027979
• a(n) = 2^n - 3.at n=16A036563
• New record highs reached in A060030.at n=29A060482
• Row sums of the triangle described in A082200.at n=37A082203
• Smallest number having in binary representation a prefix of length n that is also a suffix of its successor.at n=15A091270
• A Horadam-Jacobsthal sequence.at n=15A101622
• Ackermann's function A(n,0).at n=5A126333
• a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3).at n=28A136252
• a(n) = 4^(n+1) - 3.at n=7A141725
• A007318 * A143098.at n=16A143100
• a(n) is the least odd number 2^n - m minimizing A007947(m*(2^n - m)).at n=15A143701
• Ackermann function, defined recursively by A(0,n) = n+1, A(m+1,0) = A(m,1), A(m+1,n+1) = A(m,A(m+1,n)) for any nonnegative integers n, m. Table read by antidiagonals, the second term being A(0,1).at n=19A143796
• Ackermann function, defined recursively by A(0,n) = n+1, A(m+1,0) = A(m,1), A(m+1,n+1) = A(m,A(m+1,n)) for any nonnegative integers n, m. Table read by antidiagonals, the second term being A(0,1).at n=20A143796
• a(n)= -3a(n-1)-3a(n-2)-2a(n-3), n>3. a(0)=4, a(1)=4, a(2)=-5, a(3)=4.at n=17A158935
• 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=30A181314
• Expansion of (1+2x)*(1+2*x^2)/((1-x)*(1+x)*(1-2*x^2)).at n=28A185647
• Square array T(n,k) = k^n - k + 1 read by antidiagonals.at n=58A193871
• Partial sums of A173862.at n=42A200672
• Fibonacci 15-step numbers, a(n) = a(n-1) + a(n-2) + ... + a(n-15).at n=17A220493
• 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=28A226618