A105096 Length of shortest Lucas chain for n.

1, 2, 2, 3, 3, 4, 3, 4, 4

Offset

2,2

Comments

This may already be in the OEIS - the reference does not give enough terms to check. It would also be nice to give the definition here.

Lucas chains are addition chains with additional requirements on the presence of differences between members of the chain. Therefore a(n) >= A003313(n) and A104892(n) <= A003064(n). Shortest simple Lucas chains are constrained even further (forbid duplication between adjacent members). Therefore a(n) <= A105195(n). - R. J. Mathar, May 24 2008

Links

Table of n, a(n) for n=2..10.

Daniel Bleichenbacher, Efficiency and Security of Cryptosystems based on Number Theory. PhD Thesis, Diss. ETH No. 11404, Zuerich 1996. See p. 64.

Index to sequences related to the complexity of n

Crossrefs

Cf. A104892, A105195, A003313.

Sequence in context: A292042 A282715 A124831 * A157790 A070241 A066412

Adjacent sequences: A105093 A105094 A105095 * A105097 A105098 A105099

Keyword

nonn

Author

N. J. A. Sloane, May 23 2008

Status

approved