A390056 - OEIS

A390056

Smallest k for which a chain of linked rods of length 1, ..., k can be folded in half in exactly n dictinct ways.

3, 8, 20, 35, 84, 99, 195, 455, 459, 935, 440, 539, 1595, 1484, 1364, 1700, 4004, 5075, 1539, 3059, 6075, 8099, 4199, 15180, 7020, 9800, 10556, 14651, 7524, 45539, 25839, 11339, 19844, 20124, 28860, 14364, 30855, 11780, 13299, 12375, 23715, 32724, 58995

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Also: Smallest k for which a chain of linked rods of length 1, ..., k can make a rectangle in exactly A000217(n-1) dictinct ways.

LINKS

Daniel Mondot, Table of n, a(n) for n = 1..502

EXAMPLE

A chain of 3 rods 1,2,3 can only be folded in half in 1 way. 1 and 2 on one side, 3 on the other.

A chain of 8 rods 1,...,8 can be folded in half in exactly 2 ways. These are the diagonals of the rectangle shown in A380867.

CROSSREFS

Cf. A382605, A380867, A380868.