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 A104892 #22 Oct 21 2024 16:49:33 %S A104892 2,3,5,7,11,17,23,37,53,83,127,197,331,461,739,1123,1801,2903,4463, %T A104892 6947,10973,17539,26627,43103,67079,109639,160649,271829,432199, %U A104892 665789,1080491,1666943,2668909,4182169,6786257,10612027,17010151,26901547,42105257,67208321,105414851,169631897,265359847,423344501,672662981,1065233261,1653387299,2680042177,4243717559,6698246557 %N A104892 Smallest number whose shortest Lucas chain is of length n. %H A104892 Daniel Bleichenbacher, <a href="http://cr.yp.to/bib/1996/bleichenbacher-thesis.ps">Efficiency and Security of Cryptosystems based on Number Theory</a>, PhD Thesis, Diss. ETH No. 11404, Zürich 1996. See p. 69. %H A104892 Neill Clift, <a href="http://additionchains.com/Lucas.html">Lucas/Differential Addition Chains</a>. %H A104892 Wikipedia, <a href="https://en.wikipedia.org/wiki/Lucas_chain">Lucas chain</a>. %H A104892 <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a> %Y A104892 Cf. A105096, A105195, A003313. %K A104892 nonn %O A104892 1,1 %A A104892 _N. J. A. Sloane_, May 23 2008 %E A104892 a(30) onwards from _Neill M. Clift_, Oct 19 2024