A245539 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)=4*A083424(k-r-1)*a(j).

1, 1, 3, 1, 4, 3, 14, 1, 4, 4, 12, 3, 12, 14, 52, 1, 4, 4, 12, 4, 16, 12, 56, 3, 12, 12, 36, 14, 56, 52, 216, 1, 4, 4, 12, 4, 16, 12, 56, 4, 16, 16, 48, 12, 48, 56, 208, 3, 12, 12, 36, 12, 48, 36, 168, 14, 56, 56, 168, 52, 208, 216, 848

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 4.

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

Examples

			Arranged into blocks:
1,
1, 3,
1, 4, 3, 14,
1, 4, 4, 12, 3, 12, 14, 52,
1, 4, 4, 12, 4, 16, 12, 56, 3, 12, 12, 36, 14, 56, 52, 216,
1, 4, 4, 12, 4, 16, 12, 56, 4, 16, 16, 48, 12, 48, 56, 208, 3, 12, 12, 36, 12, 48, 36, 168, 14, 56, 56, 168, 52, 208, 216, 848,
...
		

Crossrefs

Cf. A245196, A245180.