A105096 - OEIS

This site is supported by donations to The OEIS Foundation.

A105096

Length of shortest Lucas chain for n.

1, 2, 2, 3, 3, 4, 3, 4, 4 (list; graph; refs; listen; history; internal format)

	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 (mathar(AT)strw.leidenuniv.nl), May 24 2008`
	LINKS	`Daniel Bleichenbacher, Efficiency and Security of Cryptosystems based on Number Theory. PhD Thesis, Diss. ETH No. 11404, Zuerich 1996. See p. 64.`
	CROSSREFS	`Cf. A104892, A105195, A003313.` `Sequence in context: A075167 A057935 A124831 * A157790 A070241 A066412` `Adjacent sequences: A105093 A105094 A105095 * A105097 A105098 A105099`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), May 23 2008`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 05:41 EST 2012. Contains 205570 sequences.