1,1

Sequence corresponds to the maximum chain length of a variant of the classical puzzle whereby, under agreed terms, a ringed golden chain asset of a(n) links, when judiciously fragmented into n opened links(through n cuts) and n pieces of lengths (2n+1), (2n+1)*3, (2n+1)*3^2, ..., (2n+1)*3^(n-1), may be used to sequentially settle for payment equivalent up to a(n)-link cost, a link-cost at a time, with swapping allowed with identical fragments owned by the creditor.

For instance the 4 fragmented chains of original length a(4)=364 into

.1.+..9..+.1

.+.........+

243.......27

.+.........+

.1.+..81.+.1

when swapped with identical fragments owned by the creditor, enable the sequential payment, a link-cost at a time, for an expense up to 364 link-costs.

a:=n->sum (3^j*n^binomial(j, n), j=0..n): seq(a(n), n=1..23); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 18 2009]

Cf. A014915, A064017, A027261.

Sequence in context: A027074 A036922 A036926 this_sequence A007901 A088581 A017970

Adjacent sequences: A079269 A079270 A079271 this_sequence A079273 A079274 A079275

nonn

Lekraj Beedassy (blekraj(AT)yahoo.com), Feb 06 2003

More terms from Michel ten Voorde (seqfan(AT)tenvoorde.org) Jun 20 2003