Leonardo number

The Leonardo numbers are a sequence of numbers given by the recurrence:

L(n) = \begin{cases} 1 & \mbox{if } n = 0 \\ 1 & \mbox{if } n = 1 \\ L(n - 1) + L(n - 2) + 1 & \mbox{if } n > 1 \\ \end{cases}

Edsger W. Dijkstra^[1] used them as an integral part of his smoothsort algorithm,^[2] and also analyzed them in some detail.^[3]

Values

The first few Leonardo numbers are

1,\;1,\;3,\;5,\;9,\;15,\;25,\;41,\;67,\;109,\;177,\;287,\;465,\;753,\;1219,\;1973,\;3193,\;5167,\;8361, \ldots

(sequence A001595 in the OEIS)

Relation to Fibonacci numbers

The Leonardo numbers are related to the Fibonacci numbers by the relation $L(n) = 2 F(n+1) - 1, n \ge 0$ .

From this relation it is straightforward to derive a closed-form expression for the Leonardo numbers, analogous to Binet's formula for the Fibonacci numbers:

L(n) = 2 \frac{\varphi^{n+1} - \psi^{n+1}}{\varphi - \psi}- 1 = \frac{2}{\sqrt 5} \left(\varphi^{n+1} - \psi^{n+1}\right) - 1 = 2F(n+1) - 1

where the golden ratio $\varphi = \left(1 + \sqrt 5\right)/2$ and $\psi = \left(1 - \sqrt 5\right)/2$ are the roots of the quadratic polynomial $x^2 - x - 1 = 0$ .

References

↑ EWD797
↑ Dijkstra, Edsger W. Smoothsort – an alternative to sorting in situ (EWD-796a). E.W. Dijkstra Archive. Center for American History, University of Texas at Austin. (original; transcription)
↑ EWD796a

External links

"Sloane's A001595". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

Classes of natural numbers

Powers and
related numbers

Of the form
a × 2^b ± 1

Other polynomial
numbers

Recursively defined
numbers

Possessing a
specific set
of other numbers

Expressible via
specific sums

Generated
via a sieve

Lucky

Code related

Meertens

Figurate numbers

2-dimensional

centered	Centered triangular Centered square Centered pentagonal Centered hexagonal Centered heptagonal Centered octagonal Centered nonagonal Centered decagonal Star

non-centered	Triangular Square Square triangular Pentagonal Hexagonal Heptagonal Octagonal Nonagonal Decagonal Dodecagonal

3-dimensional

centered	Centered tetrahedral Centered cube Centered octahedral Centered dodecahedral Centered icosahedral

non-centered	Tetrahedral Octahedral Dodecahedral Icosahedral Stella octangula

pyramidal	Square pyramidal Pentagonal pyramidal Hexagonal pyramidal Heptagonal pyramidal

4-dimensional

centered	Centered pentachoric Squared triangular

non-centered	Pentatope

Pseudoprimes

Combinatorial
numbers

Arithmetic functions

By properties of σ(n)	Abundant Almost perfect Arithmetic Colossally abundant Descartes Hemiperfect Highly abundant Highly composite Hyperperfect Multiply perfect Perfect Practical number Primitive abundant Quasiperfect Refactorable Sublime Superabundant Superior highly composite Superperfect

By properties of Ω(n)	Almost prime Semiprime

By properties of φ(n)	Highly cototient Highly totient Noncototient Nontotient Perfect totient Sparsely totient

By properties of s(n)	Amicable Betrothed Deficient Semiperfect

Dividing a quotient

Other prime factor
or divisor related
numbers

Recreational
mathematics

Base-dependent
numbers

This article is issued from Wikipedia - version of the 7/13/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.