|
%I #38 Feb 18 2024 02:00:58
%S 1,21,22,43,65,108,173,281,454,735,1189,1924,3113,5037,8150,13187,
%T 21337,34524,55861,90385,146246,236631,382877,619508,1002385,1621893,
%U 2624278,4246171,6870449,11116620,17987069,29103689,47090758,76194447,123285205,199479652,322764857,522244509
%N Fibonacci sequence beginning 1, 21.
%C a(n-1) = Sum_{k=0..ceiling((n-1)/2)} P(21;n-1-k,k), n>=1, with a(-1)=20. These are the SW-NE diagonals in P(21;n,k), the (21,1) Pascal triangle. Cf. A093645 for the (10,1) Pascal triangle. Observation by _Paul Barry_, Apr 29 2004. Proof via recursion relations and comparison of inputs.
%H G. C. Greubel, <a href="/A022391/b022391.txt">Table of n, a(n) for n = 0..1000</a>
%H S. Kak, <a href="https://arxiv.org/abs/physics/0411195">The Golden Mean and the Physics of Aesthetics</a>, arXiv:physics/0411195 [physics.hist-ph], 2004.
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F a(n) = a(n-1) + a(n-2), n>=2, a(0)=1, a(1)=21. a(-1):=20.
%F G.f.: (1+20*x)/(1-x-x^2).
%t LinearRecurrence[{1, 1}, {1, 21}, 30] (* _Jean-François Alcover_, Feb 25 2018 *)
%t Table[Fibonacci[n + 2] + 19*Fibonacci[n], {n, 0, 50}] (* _G. C. Greubel_, Mar 02 2018 *)
%o (PARI) for(n=0, 50, print1(fibonacci(n+2) + 19*fibonacci(n), ", ")) \\ _G. C. Greubel_, Mar 02 2018
%o (Magma) [Fibonacci(n+2) + 19*Fibonacci(n): n in [0..50]]; // _G. C. Greubel_, Mar 02 2018
%K nonn
%O 0,2
%A _N. J. A. Sloane_
%E Terms a(30) onward added by _G. C. Greubel_, Mar 02 2018
|
