466033

Properties

Appears in sequences

• Base-4 digits are, in order, the first n terms of the periodic sequence with initial period 1,3,0.at n=9A037597
• a(n) = a(n-1) + 2^(A047258(n)) for n>1, a(1)=1.at n=9A113867
• First differences of A131666.at n=22A131090
• a(0)=1. a(n+1)=2*a(n)-A130151(n).at n=21A132780
• a(n) = 2*a(n-1) - a(n-3) + 2*a(n-4).at n=19A135350
• a(n) = floor(2^n/9).at n=22A153234
• Numbers of form 4^(3*k+l+1)/9 - 4^l/9 - 1/3 or 2*4^(3*k+l+2)/9 - 2*4^l/9 - 1/3, k,l>=0.at n=43A172143
• Greatest odd number that requires n Collatz (3x+1) iterations to reach 1, or zero if there is no such number.at n=24A176868
• Odd numbers producing exactly 3 odd numbers in the Collatz (3x+1) iteration.at n=29A198584
• Numbers n such that floor(2^A006666(n)/3^A006667(n)) = n.at n=43A211981
• Prime numbers having no additional odd primes in their Collatz (3x+1) trajectory.at n=17A221476
• Greatest odd number k such that difference between halving and tripling steps in Collatz (3x+1) trajectory of k is n, or 0 if there is no such k.at n=20A222755
• Odd numbers producing 3 decreasing odd numbers in the Collatz (3x+1) iteration.at n=26A228872
• Numbers of the form (2^(2*j + 6*k + 10) - 2^(2*j + 2) - 3)/9, with j,k >= 0.at n=11A342816
• a(n) = (2^(3*n + 3 + (-1)^n) - (6 + (-1)^n))/9, for n >= 1.at n=5A350053
• a(n) = (4^(3*n+2) - 7)/9.at n=2A350054
• Prime numbersat n=38918