This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A105096 #12 Apr 19 2025 19:37:20 %S A105096 0,1,2,2,3,3,4,3,4,4,5,4,5,5,5,4,6,5,6,5,6,6,7,5,6,6,6,6,7,6,7,5,7,7, %T A105096 7,6,8,7,7,6,8,7,8,7,7,8,8,6,8,7,8,7,9,7,8,7,8,8,9,7,9,8,8,6,8,8,9,8, %U A105096 9,8,9,7,9,9,8,8,9,8,9,7,8,9,10,8,9,9,9 %N A105096 Length of shortest Lucas chain for n. %C A105096 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 %H A105096 Jinyuan Wang, <a href="/A105096/b105096.txt">Table of n, a(n) for n = 1..10000</a> %H A105096 Daniel Bleichenbacher, <a href="http://www.bell-labs.com/user/bleichen/diss/thesis.html">Efficiency and Security of Cryptosystems based on Number Theory.</a> PhD Thesis, Diss. ETH No. 11404, Zuerich 1996. See p. 64. %H A105096 Neill Clift, <a href="http://additionchains.com/Lucas.html">Lucas/Differential Addition Chains</a>. %H A105096 Wikipedia, <a href="https://en.wikipedia.org/wiki/Lucas_chain">Lucas chain</a>. %H A105096 <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a> %Y A105096 Cf. A003313, A104892, A105195, A266082. %K A105096 nonn %O A105096 1,3 %A A105096 _N. J. A. Sloane_, May 23 2008 %E A105096 Offset changed to 1 and more terms from _Jinyuan Wang_, Apr 18 2025