A358096 a(n) is the number of ways n can be reached in the algorithm explained in A358094 if the last operation is multiplication.

1, 1, 1, 0, 0, 1, 0, 2, 1, 2, 0, 3, 0, 0, 2, 1, 0, 2, 0, 2, 0, 3, 0, 4, 0, 2, 1, 3, 0, 5, 0, 0, 3, 2, 0, 6, 0, 1, 2, 2, 0, 5, 0, 2, 3, 2, 0, 3, 0, 3, 2, 4, 0, 7, 0, 2, 1, 3, 0, 6, 0, 3, 2, 5, 0, 7, 0, 0, 2, 3, 0, 8, 0, 2, 3, 6, 0, 10, 0, 1

Offset: 1

Author

Yifan Xie, Nov 01 2022

Keywords

• nonn
• easy

Examples

			There are 3 ways to reach 12: (1*3+3)*2=12, (1*2+2)*3=12 and (1+3)*3=12.
		

Links

• Yifan Xie, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A358094, A358095.

Formula

a(n) = A358095(n/2) + A358095(n/3) if n == 0 (mod 6);

a(n) = A358095(n/2) if n == 2 or 4 (mod 6);

a(n) = A358095(n/3) if n == 3 (mod 6);

a(n) = 0 if n == 1 or 5 (mod 6).