194948

Appears in sequences

• Number of times when an odd number is encountered, when going from 2^(n+1)-1 to (2^n)-1 using the iterative process described in A071542.at n=22A218543
• a(n) = 4*n*(4*n^2 + 3).at n=23A271636
• a(n) = a(n-2) + a(n-3) + a(n-4) with a(0) = 0, a(1) = a(2) = 1, a(3) = 0.at n=35A277252