A245537 Write n>=1 as either n=2^k-2^r with 0 <= r <= k-1, in which case a(2^k-2^r)=A083424(k-r-1), or as n=2^k-2^r+j with 2 <= r <= k-1, 1 <= j < 2^r-1, in which case a(2^k-2^r+j)=A083424(k-r-1)*a(j).

1, 1, 3, 1, 1, 3, 14, 1, 1, 1, 3, 3, 3, 14, 52, 1, 1, 1, 3, 1, 1, 3, 14, 3, 3, 3, 9, 14, 14, 52, 216, 1, 1, 1, 3, 1, 1, 3, 14, 1, 1, 1, 3, 3, 3, 14, 52, 3, 3, 3, 9, 3, 3, 9, 42, 14, 14, 14, 42, 52, 52, 216, 848, 1, 1, 1, 3, 1, 1, 3, 14, 1, 1, 1, 3, 3, 3, 14, 52

Offset: 1

Author

N. J. A. Sloane, Jul 26 2014

Keywords

• nonn
• tabf

Comments

Similar to A245180, except the multiplier 8 in that recurrence is set here to be 1.

See A245196 for a list of other sequences produced by this type of recurrence.

Examples

			Arranged into blocks:
1,
1, 3,
1, 1, 3, 14,
1, 1, 1, 3, 3, 3, 14, 52,
1, 1, 1, 3, 1, 1, 3, 14, 3, 3, 3, 9, 14, 14, 52, 216,
1, 1, 1, 3, 1, 1, 3, 14, 1, 1, 1, 3, 3, 3, 14, 52, 3, 3, 3, 9, 3, 3, 9, 42, 14, 14, 14, 42, 52, 52, 216, 848,
...
		

Crossrefs

Cf. A083424, A245180, A245196.