Knuth, Donald (2006), The Art of Computer Programming, vol. 4. Generating All Trees – History of Combinatorial Generation, Addison–Wesley, էջ 50, ISBN978-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)»
doi.org
Singh, Parmanand (1985), «The So-called Fibonacci numbers in ancient and medieval India», Historia Mathematica, 12 (3): 229–44, doi:10.1016/0315-0860(85)90021-7
Beutelspacher, Albrecht; Petri, Bernhard (1996), «Fibonacci-Zahlen», Der Goldene Schnitt, Einblick in die Wissenschaft, Vieweg+Teubner Verlag, էջեր 87–98, doi:10.1007/978-3-322-85165-9_6, ISBN978-3-8154-2511-4