login
a(n) = ceiling(n*phi^17), where phi is the golden ratio, A001622.
1

%I #16 Jul 04 2019 15:25:13

%S 0,3572,7143,10714,14285,17856,21427,24998,28569,32140,35711,39282,

%T 42853,46424,49995,53566,57137,60708,64279,67850,71421,74992,78563,

%U 82134,85705,89276,92847,96418,99989,103560,107131,110702,114273,117844,121415,124986

%N a(n) = ceiling(n*phi^17), where phi is the golden ratio, A001622.

%H Colin Barker, <a href="/A004972/b004972.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).

%F From _Colin Barker_, Dec 22 2014: (Start)

%F a(n) = 3571*n + 1 for n > 0.

%F a(n) = 2*a(n-1) - a(n-2) for n > 2.

%F G.f.: -x*(x-3572) / (x-1)^2.

%F (End)

%o (PARI) concat(0, Vec(-x*(x-3572)/(x-1)^2 + O(x^100))) \\ _Colin Barker_, Dec 22 2014

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_

%E More terms from _Colin Barker_, Dec 22 2014