Revision as of 09:39, 18 July 2025 edit 2a00:23c7:9910:ee01:295c:a9b5:540b:86b (talk) →Is there a generating function: new section Tag: New topic ← Previous edit		Revision as of 10:03, 18 July 2025 edit undo Jacobolus (talk \| contribs) Extended confirmed users 40,160 edits →Is there a generating function: Reply Tag: Reply Next edit →
Line 106: I noticed in the part where it said generating function it did not go in to terms on how to make Fn without writing the whole list, just in something else. Also , the connection to Pascal’s triangle is important and should be added [[Special:Contributions/2A00:23C7:9910:EE01:295C:A9B5:540B:86B\|2A00:23C7:9910:EE01:295C:A9B5:540B:86B]] ([[User talk:2A00:23C7:9910:EE01:295C:A9B5:540B:86B\|talk]]) 09:39, 18 July 2025 (UTC) :I don't understand your question about the generating function. As for your other point, the article has a diagram and the line 'The Fibonacci numbers occur as the sums of binomial coefficients in the "shallow" diagonals of Pascal's triangle'. –[[user:jacobolus\|jacobolus]] [[user_talk:jacobolus\|(t)]] 10:03, 18 July 2025 (UTC)

Talk:Fibonacci sequence: Difference between revisions