Fibonacci sequence (English Wikipedia)
Analysis of information sources in references of the Wikipedia article "Fibonacci sequence" in English language version.
Last modified:
Ref.Un. Ref.Website
Global rank
English rank
3rd place
3rd place
1st place
1st place
15th place
8th place
6th place
6th place
14th place
9th place
1,091st place
1,169th place
low place
7,432nd place
66th place
34th place
4th place
4th place
9,908th place
5,497th place
868th place
634th place
194th place
182nd place
low place
low place
low place
low place
low place
low place
low place
low place
4,781st place
3,117th place
low place
low place
low place
low place
low place
low place
1,053rd place
1,274th place
low place
low place
low place
low place
7,049th place
5,456th place
low place
low place
adsabs.harvard.edu (Global: 14th place; English: 9th place)
ui.adsabs.harvard.edu
- Bugeaud, Y; Mignotte, M; Siksek, S (2006), "Classical and modular approaches to exponential Diophantine equations. I. Fibonacci and Lucas perfect powers", Ann. Math., 2 (163): 969–1018, arXiv:math/0403046, Bibcode:2004math......3046B, doi:10.4007/annals.2006.163.969, S2CID 10266596
- Nayak, Chetan; Simon, Steven H.; Stern, Ady; Freedman, Michael; Das Sarma, Sankar (2008-09-12). "Non-Abelian anyons and topological quantum computation". Reviews of Modern Physics. 80 (3): 1083–1159. arXiv:0707.1889. Bibcode:2008RvMP...80.1083N. doi:10.1103/RevModPhys.80.1083.
- Patranabis, D.; Dana, S. K. (December 1985), "Single-shunt fault diagnosis through terminal attenuation measurement and using Fibonacci numbers", IEEE Transactions on Instrumentation and Measurement, IM-34 (4): 650–653, Bibcode:1985ITIM...34..650P, doi:10.1109/tim.1985.4315428, S2CID 35413237
algorithmicbotany.org (Global: low place; English: low place)
- Prusinkiewicz, Przemyslaw; Lindenmayer, Aristid (1990), "4", The Algorithmic Beauty of Plants, Springer-Verlag, pp. 101–107, ISBN 978-0-387-97297-8
ams.org (Global: 434th place; English: 249th place)
mathscinet.ams.org
- André-Jeannin, Richard (1989), "Irrationalité de la somme des inverses de certaines suites récurrentes" [Irrationality of the sum of the reciprocals of certain recurrence sequences], Comptes Rendus de l'Académie des Sciences, Série I (in French), 308 (19): 539–41, MR 0999451
- Williams, H. C. (1982), "A note on the Fibonacci quotient ", Canadian Mathematical Bulletin, 25 (3): 366–70, doi:10.4153/CMB-1982-053-0, hdl:10338.dmlcz/137492, MR 0668957. Williams calls this property "well known".
- Diaconis, Persi (2018), "Probabilizing Fibonacci numbers" (PDF), in Butler, Steve; Cooper, Joshua; Hurlbert, Glenn (eds.), Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham, Cambridge University Press, pp. 1–12, ISBN 978-1-107-15398-1, MR 3821829, archived from the original (PDF) on 2023-11-18, retrieved 2022-11-23
- Cohn, J. H. E. (1964), "On square Fibonacci numbers", The Journal of the London Mathematical Society, 39: 537–540, doi:10.1112/jlms/s1-39.1.537, MR 0163867
- Luca, Florian (2000), "Perfect Fibonacci and Lucas numbers", Rendiconti del Circolo Matematico di Palermo, 49 (2): 313–18, doi:10.1007/BF02904236, ISSN 1973-4409, MR 1765401, S2CID 121789033
- Broughan, Kevin A.; González, Marcos J.; Lewis, Ryan H.; Luca, Florian; Mejía Huguet, V. Janitzio; Togbé, Alain (2011), "There are no multiply-perfect Fibonacci numbers", Integers, 11a: A7, MR 2988067
- Luca, Florian; Mejía Huguet, V. Janitzio (2010), "On Perfect numbers which are ratios of two Fibonacci numbers", Annales Mathematicae at Informaticae, 37: 107–24, ISSN 1787-6117, MR 2753031
- Lü, Kebo; Wang, Jun (2006), "k-step Fibonacci sequence modulo m", Utilitas Mathematica, 71: 169–177, MR 2278830
- Stephenson, Kenneth (2005), Introduction to Circle Packing: The Theory of Discrete Analytic Functions, Cambridge University Press, ISBN 978-0-521-82356-2, MR 2131318; see especially Lemma 8.2 (Ring Lemma), pp. 73–74, and Appendix B, The Ring Lemma, pp. 318–321.
aps.org (Global: 1,264th place; English: 951st place)
link.aps.org
- Nayak, Chetan; Simon, Steven H.; Stern, Ady; Freedman, Michael; Das Sarma, Sankar (2008-09-12). "Non-Abelian anyons and topological quantum computation". Reviews of Modern Physics. 80 (3): 1083–1159. arXiv:0707.1889. Bibcode:2008RvMP...80.1083N. doi:10.1103/RevModPhys.80.1083.
archive.org (Global: 6th place; English: 6th place)
- Lucas 1891, p. 3. Lucas, Édouard (1891), Théorie des nombres (in French), vol. 1, Paris: Gauthier-Villars.
- Lucas 1891, p. 4. Lucas, Édouard (1891), Théorie des nombres (in French), vol. 1, Paris: Gauthier-Villars.
- Lucas 1891, p. 7. Lucas, Édouard (1891), Théorie des nombres (in French), vol. 1, Paris: Gauthier-Villars.
- Prusinkiewicz, Przemyslaw; Lindenmayer, Aristid (1990), "4", The Algorithmic Beauty of Plants, Springer-Verlag, pp. 101–107, ISBN 978-0-387-97297-8
arxiv.org (Global: 49th place; English: 31st place)
- Bugeaud, Y; Mignotte, M; Siksek, S (2006), "Classical and modular approaches to exponential Diophantine equations. I. Fibonacci and Lucas perfect powers", Ann. Math., 2 (163): 969–1018, arXiv:math/0403046, Bibcode:2004math......3046B, doi:10.4007/annals.2006.163.969, S2CID 10266596
- Nayak, Chetan; Simon, Steven H.; Stern, Ady; Freedman, Michael; Das Sarma, Sankar (2008-09-12). "Non-Abelian anyons and topological quantum computation". Reviews of Modern Physics. 80 (3): 1083–1159. arXiv:0707.1889. Bibcode:2008RvMP...80.1083N. doi:10.1103/RevModPhys.80.1083.
books.google.com (Global: 3rd place; English: 3rd place)
- Goonatilake, Susantha (1998), Toward a Global Science, Indiana University Press, p. 126, ISBN 978-0-253-33388-9
- Knuth, Donald (2006), The Art of Computer Programming, vol. 4. Generating All Trees – History of Combinatorial Generation, Addison–Wesley, p. 50, ISBN 978-0-321-33570-8,
it was natural to consider the set of all sequences of [L] and [S] that have exactly m beats. ... there are exactly Fm+1 of them. For example the 21 sequences when m = 7 are: [gives list]. In this way Indian prosodists were led to discover the Fibonacci sequence, as we have observed in Section 1.2.8 (from v.1)
- Knuth, Donald (1968), The Art of Computer Programming, vol. 1, Addison Wesley, p. 100, ISBN 978-81-7758-754-8,
Before Fibonacci wrote his work, the sequence Fn had already been discussed by Indian scholars, who had long been interested in rhythmic patterns ... both Gopala (before 1135 AD) and Hemachandra (c. 1150) mentioned the numbers 1,2,3,5,8,13,21 explicitly [see P. Singh Historia Math 12 (1985) 229–44]" p. 100 (3d ed) ...
- Livio 2003, p. 197. Livio, Mario (2003) [2002], The Golden Ratio: The Story of Phi, the World's Most Astonishing Number (First trade paperback ed.), New York City: Broadway Books, ISBN 0-7679-0816-3
- Livio 2003, pp. 197–198. Livio, Mario (2003) [2002], The Golden Ratio: The Story of Phi, the World's Most Astonishing Number (First trade paperback ed.), New York City: Broadway Books, ISBN 0-7679-0816-3
- belcastro, sarah-marie (2018). Discrete Mathematics with Ducks (2nd ed.). CRC Press. p. 260. ISBN 978-1-351-68369-2. Extract of page 260
- Stephenson, Kenneth (2005), Introduction to Circle Packing: The Theory of Discrete Analytic Functions, Cambridge University Press, ISBN 978-0-521-82356-2, MR 2131318; see especially Lemma 8.2 (Ring Lemma), pp. 73–74, and Appendix B, The Ring Lemma, pp. 318–321.
- Livio 2003, p. 110. Livio, Mario (2003) [2002], The Golden Ratio: The Story of Phi, the World's Most Astonishing Number (First trade paperback ed.), New York City: Broadway Books, ISBN 0-7679-0816-3
- Livio 2003, pp. 112–13. Livio, Mario (2003) [2002], The Golden Ratio: The Story of Phi, the World's Most Astonishing Number (First trade paperback ed.), New York City: Broadway Books, ISBN 0-7679-0816-3
- Livio 2003, p. 112. Livio, Mario (2003) [2002], The Golden Ratio: The Story of Phi, the World's Most Astonishing Number (First trade paperback ed.), New York City: Broadway Books, ISBN 0-7679-0816-3
- Livio 2003, pp. 98–99. Livio, Mario (2003) [2002], The Golden Ratio: The Story of Phi, the World's Most Astonishing Number (First trade paperback ed.), New York City: Broadway Books, ISBN 0-7679-0816-3
- Livio 2003, p. 176. Livio, Mario (2003) [2002], The Golden Ratio: The Story of Phi, the World's Most Astonishing Number (First trade paperback ed.), New York City: Broadway Books, ISBN 0-7679-0816-3
- Livio 2003, p. 193. Livio, Mario (2003) [2002], The Golden Ratio: The Story of Phi, the World's Most Astonishing Number (First trade paperback ed.), New York City: Broadway Books, ISBN 0-7679-0816-3
byu.edu (Global: 1,502nd place; English: 829th place)
fhtw.byu.edu
- Hutchison, Luke (September 2004), "Growing the Family Tree: The Power of DNA in Reconstructing Family Relationships" (PDF), Proceedings of the First Symposium on Bioinformatics and Biotechnology (BIOT-04), archived from the original (PDF) on 2020-09-25, retrieved 2016-09-03
colgate.edu (Global: low place; English: low place)
math.colgate.edu
- Broughan, Kevin A.; González, Marcos J.; Lewis, Ryan H.; Luca, Florian; Mejía Huguet, V. Janitzio; Togbé, Alain (2011), "There are no multiply-perfect Fibonacci numbers", Integers, 11a: A7, MR 2988067
cs4fn.org (Global: low place; English: low place)
- "Marks for the da Vinci Code: B–", Maths, Computer Science For Fun: CS4FN
doi.org (Global: 2nd place; English: 2nd place)
- Singh, Parmanand (1985), "The So-called Fibonacci numbers in ancient and medieval India", Historia Mathematica, 12 (3): 229–244, doi:10.1016/0315-0860(85)90021-7
- Tassone, Ann Dominic (April 1967), "A pair of rabbits and a mathematician", The Arithmetic Teacher, 14 (4): 285–288, doi:10.5951/at.14.4.0285, JSTOR 41187298
- Beutelspacher, Albrecht; Petri, Bernhard (1996), "Fibonacci-Zahlen", Der Goldene Schnitt, Einblick in die Wissenschaft, Vieweg+Teubner Verlag, pp. 87–98, doi:10.1007/978-3-322-85165-9_6, ISBN 978-3-8154-2511-4
- Glaister, P (1995), "Fibonacci power series", The Mathematical Gazette, 79 (486): 521–25, doi:10.2307/3618079, JSTOR 3618079, S2CID 116536130
- Williams, H. C. (1982), "A note on the Fibonacci quotient ", Canadian Mathematical Bulletin, 25 (3): 366–70, doi:10.4153/CMB-1982-053-0, hdl:10338.dmlcz/137492, MR 0668957. Williams calls this property "well known".
- Cohn, J. H. E. (1964), "On square Fibonacci numbers", The Journal of the London Mathematical Society, 39: 537–540, doi:10.1112/jlms/s1-39.1.537, MR 0163867
- Bugeaud, Y; Mignotte, M; Siksek, S (2006), "Classical and modular approaches to exponential Diophantine equations. I. Fibonacci and Lucas perfect powers", Ann. Math., 2 (163): 969–1018, arXiv:math/0403046, Bibcode:2004math......3046B, doi:10.4007/annals.2006.163.969, S2CID 10266596
- Luo, Ming (1989), "On triangular Fibonacci numbers" (PDF), Fibonacci Quart., 27 (2): 98–108, doi:10.1080/00150517.1989.12429576
- Luca, Florian (2000), "Perfect Fibonacci and Lucas numbers", Rendiconti del Circolo Matematico di Palermo, 49 (2): 313–18, doi:10.1007/BF02904236, ISSN 1973-4409, MR 1765401, S2CID 121789033
- Freyd, Peter; Brown, Kevin S. (1993), "Problems and Solutions: Solutions: E3410", The American Mathematical Monthly, 99 (3): 278–79, doi:10.2307/2325076, JSTOR 2325076
- Avriel, M; Wilde, DJ (1966), "Optimality of the Symmetric Fibonacci Search Technique", Fibonacci Quarterly (3): 265–69, doi:10.1080/00150517.1966.12431364
- Nayak, Chetan; Simon, Steven H.; Stern, Ady; Freedman, Michael; Das Sarma, Sankar (2008-09-12). "Non-Abelian anyons and topological quantum computation". Reviews of Modern Physics. 80 (3): 1083–1159. arXiv:0707.1889. Bibcode:2008RvMP...80.1083N. doi:10.1103/RevModPhys.80.1083.
- Simon, Steven H. (2023-09-29). Topological Quantum. Oxford University PressOxford. p. 98. doi:10.1093/oso/9780198886723.001.0001. ISBN 978-0-19-888672-3.
- Douady, S; Couder, Y (1996), "Phyllotaxis as a Dynamical Self Organizing Process" (PDF), Journal of Theoretical Biology, 178 (3): 255–74, doi:10.1006/jtbi.1996.0026, archived from the original (PDF) on 2006-05-26
- Brousseau, A (1969), "Fibonacci Statistics in Conifers", Fibonacci Quarterly, 7 (5): 525–32, doi:10.1080/00150517.1969.12431136
- Vogel, Helmut (1979), "A better way to construct the sunflower head", Mathematical Biosciences, 44 (3–4): 179–89, doi:10.1016/0025-5564(79)90080-4
- Basin, S. L. (1963), "The Fibonacci sequence as it appears in nature" (PDF), The Fibonacci Quarterly, 1 (1): 53–56, doi:10.1080/00150517.1963.12431602
- Patranabis, D.; Dana, S. K. (December 1985), "Single-shunt fault diagnosis through terminal attenuation measurement and using Fibonacci numbers", IEEE Transactions on Instrumentation and Measurement, IM-34 (4): 650–653, Bibcode:1985ITIM...34..650P, doi:10.1109/tim.1985.4315428, S2CID 35413237
- Brasch, T. von; Byström, J.; Lystad, L.P. (2012), "Optimal Control and the Fibonacci Sequence", Journal of Optimization Theory and Applications, 154 (3): 857–78, doi:10.1007/s10957-012-0061-2, hdl:11250/180781, S2CID 8550726
ektf.hu (Global: low place; English: low place)
ami.ektf.hu
- Luca, Florian; Mejía Huguet, V. Janitzio (2010), "On Perfect numbers which are ratios of two Fibonacci numbers", Annales Mathematicae at Informaticae, 37: 107–24, ISSN 1787-6117, MR 2753031
encyclopediaofmath.org (Global: 7,049th place; English: 5,456th place)
- "Zeckendorf representation", Encyclopedia of Math
hdl.handle.net (Global: 66th place; English: 34th place)
- Williams, H. C. (1982), "A note on the Fibonacci quotient ", Canadian Mathematical Bulletin, 25 (3): 366–70, doi:10.4153/CMB-1982-053-0, hdl:10338.dmlcz/137492, MR 0668957. Williams calls this property "well known".
- Brasch, T. von; Byström, J.; Lystad, L.P. (2012), "Optimal Control and the Fibonacci Sequence", Journal of Optimization Theory and Applications, 154 (3): 857–78, doi:10.1007/s10957-012-0061-2, hdl:11250/180781, S2CID 8550726
hmc.edu (Global: low place; English: low place)
math.hmc.edu
- Su, Francis E. (2000), "Fibonacci GCD's, Please", Mudd Math Fun Facts, Harvey Mudd College Math Department, archived from the original on 2009-12-14, retrieved 2007-02-23
jstor.org (Global: 23rd place; English: 15th place)
- Tassone, Ann Dominic (April 1967), "A pair of rabbits and a mathematician", The Arithmetic Teacher, 14 (4): 285–288, doi:10.5951/at.14.4.0285, JSTOR 41187298
- Glaister, P (1995), "Fibonacci power series", The Mathematical Gazette, 79 (486): 521–25, doi:10.2307/3618079, JSTOR 3618079, S2CID 116536130
- Freyd, Peter; Brown, Kevin S. (1993), "Problems and Solutions: Solutions: E3410", The American Mathematical Monthly, 99 (3): 278–79, doi:10.2307/2325076, JSTOR 2325076
- Pagni, David (September 2001), "Fibonacci Meets Pythagoras", Mathematics in School, 30 (4): 39–40, JSTOR 30215477
kb.se (Global: 276th place; English: 804th place)
urn.kb.se
- Brasch, T. von; Byström, J.; Lystad, L.P. (2012), "Optimal Control and the Fibonacci Sequence", Journal of Optimization Theory and Applications, 154 (3): 857–78, doi:10.1007/s10957-012-0061-2, hdl:11250/180781, S2CID 8550726
math.ca (Global: low place; English: low place)
fq.math.ca
- Gessel, Ira (October 1972), "Fibonacci is a Square" (PDF), The Fibonacci Quarterly, 10 (4): 417–19, retrieved 2012-04-11
- Luo, Ming (1989), "On triangular Fibonacci numbers" (PDF), Fibonacci Quart., 27 (2): 98–108, doi:10.1080/00150517.1989.12429576
- Basin, S. L. (1963), "The Fibonacci sequence as it appears in nature" (PDF), The Fibonacci Quarterly, 1 (1): 53–56, doi:10.1080/00150517.1963.12431602
maths.org (Global: low place; English: low place)
nrich.maths.org
- "The Golden Ratio, Fibonacci Numbers and Continued Fractions". nrich.maths.org. Retrieved 2024-03-22.
mersennus.net (Global: low place; English: low place)
- Fibonacci and Lucas factorizations, Mersennus collects all known factors of F(i) with i < 10000
northeastern.edu (Global: 9,908th place; English: 5,497th place)
web.northeastern.edu
- Shah, Jayant (1991), A History of Piṅgala's Combinatorics (PDF), Northeastern University, p. 41, archived from the original (PDF) on 2016-07-06, retrieved 2019-01-04
ntnu.no (Global: 6,459th place; English: 6,427th place)
math.ntnu.no
- Douady, S; Couder, Y (1996), "Phyllotaxis as a Dynamical Self Organizing Process" (PDF), Journal of Theoretical Biology, 178 (3): 255–74, doi:10.1006/jtbi.1996.0026, archived from the original (PDF) on 2006-05-26
numilog.com (Global: low place; English: low place)
- Varenne, Franck (2010), Formaliser le vivant - Lois, Théories, Modèles (in French), Hermann, p. 28, ISBN 9782705678128, retrieved 2022-10-30,
En 1830, K. F. Schimper et A. Braun [...]. Ils montraient que si l'on représente cet angle de divergence par une fraction reflétant le nombre de tours par feuille ([...]), on tombe régulièrement sur un des nombres de la suite de Fibonacci pour le numérateur [...].
oeis.org (Global: 1,188th place; English: 866th place)
- Sloane, N. J. A. (ed.), "Sequence A002390 (Decimal expansion of natural logarithm of golden ratio)", The On-Line Encyclopedia of Integer Sequences, OEIS Foundation
- Sloane, N. J. A. (ed.), "Sequence A097348 (Decimal expansion of arccsch(2)/log(10))", The On-Line Encyclopedia of Integer Sequences, OEIS Foundation
- Sloane, N. J. A. (ed.), "Sequence A079586 (Decimal expansion of Sum_{k>=1} 1/F(k) where F(k) is the k-th Fibonacci number)", The On-Line Encyclopedia of Integer Sequences, OEIS Foundation
- Sloane, N. J. A. (ed.), "Sequence A005478 (Prime Fibonacci numbers)", The On-Line Encyclopedia of Integer Sequences, OEIS Foundation
- Sloane, N. J. A. (ed.), "Sequence A235383 (Fibonacci numbers that are the product of other Fibonacci numbers)", The On-Line Encyclopedia of Integer Sequences, OEIS Foundation
- Sloane, N. J. A. (ed.), "Sequence A001175 (Pisano periods (or Pisano numbers): period of Fibonacci numbers mod n)", The On-Line Encyclopedia of Integer Sequences, OEIS Foundation
oup.com (Global: 292nd place; English: 233rd place)
academic.oup.com
- Simon, Steven H. (2023-09-29). Topological Quantum. Oxford University PressOxford. p. 98. doi:10.1093/oso/9780198886723.001.0001. ISBN 978-0-19-888672-3.
projecteuclid.org (Global: 4,781st place; English: 3,117th place)
- Harizanov, Valentina (1995), "Review of Yuri V. Matiyasevich, Hibert's Tenth Problem", Modern Logic, 5 (3): 345–55
redgolpe.com (Global: low place; English: low place)
fibonacci.redgolpe.com
- Factors of Fibonacci and Lucas numbers, Red golpe collects all known factors of F(i) with 10000 < i < 50000
scaledagileframework.com (Global: low place; English: low place)
- Dean Leffingwell (2021-07-01), Story, Scaled Agile Framework, retrieved 2022-08-15
scrumalliance.org (Global: low place; English: low place)
resources.scrumalliance.org
- Kathuria, Madhur. "A Guide to Using the Fibonacci Sequence in Scrum". Scrum Alliance. Retrieved 8 August 2025.
semanticscholar.org (Global: 15th place; English: 8th place)
api.semanticscholar.org
- Glaister, P (1995), "Fibonacci power series", The Mathematical Gazette, 79 (486): 521–25, doi:10.2307/3618079, JSTOR 3618079, S2CID 116536130
- Bugeaud, Y; Mignotte, M; Siksek, S (2006), "Classical and modular approaches to exponential Diophantine equations. I. Fibonacci and Lucas perfect powers", Ann. Math., 2 (163): 969–1018, arXiv:math/0403046, Bibcode:2004math......3046B, doi:10.4007/annals.2006.163.969, S2CID 10266596
- Luca, Florian (2000), "Perfect Fibonacci and Lucas numbers", Rendiconti del Circolo Matematico di Palermo, 49 (2): 313–18, doi:10.1007/BF02904236, ISSN 1973-4409, MR 1765401, S2CID 121789033
- Patranabis, D.; Dana, S. K. (December 1985), "Single-shunt fault diagnosis through terminal attenuation measurement and using Fibonacci numbers", IEEE Transactions on Instrumentation and Measurement, IM-34 (4): 650–653, Bibcode:1985ITIM...34..650P, doi:10.1109/tim.1985.4315428, S2CID 35413237
- Brasch, T. von; Byström, J.; Lystad, L.P. (2012), "Optimal Control and the Fibonacci Sequence", Journal of Optimization Theory and Applications, 154 (3): 857–78, doi:10.1007/s10957-012-0061-2, hdl:11250/180781, S2CID 8550726
st-andrews.ac.uk (Global: 1,053rd place; English: 1,274th place)
mathshistory.st-andrews.ac.uk
- Scott, T.C.; Marketos, P. (March 2014), On the Origin of the Fibonacci Sequence (PDF), MacTutor History of Mathematics archive, University of St Andrews
stanford.edu (Global: 194th place; English: 182nd place)
statweb.stanford.edu
- Diaconis, Persi (2018), "Probabilizing Fibonacci numbers" (PDF), in Butler, Steve; Cooper, Joshua; Hurlbert, Glenn (eds.), Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham, Cambridge University Press, pp. 1–12, ISBN 978-1-107-15398-1, MR 3821829, archived from the original (PDF) on 2023-11-18, retrieved 2022-11-23
surrey.ac.uk (Global: low place; English: 7,432nd place)
maths.surrey.ac.uk
- Knott, Ron, Fibonacci's Rabbits, University of Surrey Faculty of Engineering and Physical Sciences
- Knott, Ron, The Fibonacci numbers, UK: Surrey
ucanr.edu (Global: low place; English: 6,567th place)
- "The Wonder of Fibonacci in our Gardens | UC Master Gardeners of San Mateo & San Francisco Counties". ucanr.edu. Retrieved 2025-11-18.
utah.edu (Global: 2,766th place; English: 1,555th place)
math.utah.edu
- "Fibonacci's Liber Abaci (Book of Calculation)", The University of Utah, 13 December 2009, retrieved 2018-11-28
utexas.edu (Global: 868th place; English: 634th place)
cs.utexas.edu
- Dijkstra, Edsger W. (1978), In honour of Fibonacci (PDF)
utilitasmathematica.com (Global: low place; English: low place)
- Lü, Kebo; Wang, Jun (2006), "k-step Fibonacci sequence modulo m", Utilitas Mathematica, 71: 169–177, MR 2278830
web.archive.org (Global: 1st place; English: 1st place)
- Shah, Jayant (1991), A History of Piṅgala's Combinatorics (PDF), Northeastern University, p. 41, archived from the original (PDF) on 2016-07-06, retrieved 2019-01-04
- Su, Francis E. (2000), "Fibonacci GCD's, Please", Mudd Math Fun Facts, Harvey Mudd College Math Department, archived from the original on 2009-12-14, retrieved 2007-02-23
- Diaconis, Persi (2018), "Probabilizing Fibonacci numbers" (PDF), in Butler, Steve; Cooper, Joshua; Hurlbert, Glenn (eds.), Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham, Cambridge University Press, pp. 1–12, ISBN 978-1-107-15398-1, MR 3821829, archived from the original (PDF) on 2023-11-18, retrieved 2022-11-23
- Douady, S; Couder, Y (1996), "Phyllotaxis as a Dynamical Self Organizing Process" (PDF), Journal of Theoretical Biology, 178 (3): 255–74, doi:10.1006/jtbi.1996.0026, archived from the original (PDF) on 2006-05-26
- Hutchison, Luke (September 2004), "Growing the Family Tree: The Power of DNA in Reconstructing Family Relationships" (PDF), Proceedings of the First Symposium on Bioinformatics and Biotechnology (BIOT-04), archived from the original (PDF) on 2020-09-25, retrieved 2016-09-03
wolfram.com (Global: 1,091st place; English: 1,169th place)
mathworld.wolfram.com
worldcat.org (Global: 4th place; English: 4th place)
search.worldcat.org
- Luca, Florian (2000), "Perfect Fibonacci and Lucas numbers", Rendiconti del Circolo Matematico di Palermo, 49 (2): 313–18, doi:10.1007/BF02904236, ISSN 1973-4409, MR 1765401, S2CID 121789033
- Luca, Florian; Mejía Huguet, V. Janitzio (2010), "On Perfect numbers which are ratios of two Fibonacci numbers", Annales Mathematicae at Informaticae, 37: 107–24, ISSN 1787-6117, MR 2753031
zhjwpku.com (Global: low place; English: low place)
- Adelson-Velsky, Georgy; Landis, Evgenii (1962), "An algorithm for the organization of information", Proceedings of the USSR Academy of Sciences (in Russian), 146: 263–266 English translation by Myron J. Ricci in Soviet Mathematics - Doklady, 3:1259–1263, 1962.