a(n) = (a(n-1) + a(n-3))/2^m, where 2^m is the highest power of 2 that divides both a(n-1) and a(n-3), with a(0) = a(1) = a(2) = 1.
A341313
a(n) = (a(n-1) + a(n-3))/2^m, where 2^m is the highest power of 2 that divides both a(n-1) and a(n-3), with a(0) = a(1) = a(2) = 1.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =3a(5) =4a(6) =3a(7) =6a(8) =5a(9) =8a(10) =7a(11) =12a(12) =5a(13) =12a(14) =6a(15) =11a(16) =23a(17) =29a(18) =40a(19) =63a(20) =92a(21) =33a(22) =96a(23) =47a(24) =80a(25) =11a(26) =58a(27) =69a(28) =80a(29) =69
External references
- oeis: A341313