Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105096
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105096 Length of shortest Lucas chain for n. +0
3
1, 2, 2, 3, 3, 4, 3, 4, 4 (list; graph; listen)
OFFSET

2,2

COMMENT

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 this_sequence A157790 A070241 A066412

Adjacent sequences: A105093 A105094 A105095 this_sequence A105097 A105098 A105099

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), May 23 2008

page 1

Search completed in 0.006 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 12:48 EST 2009. Contains 170310 sequences.


AT&T Labs Research