This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A169986 #40 Sep 08 2022 08:45:49
%S A169986 1,2,3,5,7,12,18,30,47,77,123,200,322,522,843,1365,2207,3572,5778,
%T A169986 9350,15127,24477,39603,64080,103682,167762,271443,439205,710647,
%U A169986 1149852,1860498,3010350,4870847,7881197,12752043,20633240,33385282
%N A169986 Ceiling(phi^n) where phi = (1+sqrt(5))/2.
%H A169986 Danny Rorabaugh, <a href="/A169986/b169986.txt">Table of n, a(n) for n = 0..4000</a>
%H A169986 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1,2,-1,-1).
%F A169986 For n >= 5, a(n) = a(n-1) + 2a(n-2) - a(n-3) - a(n-4). - _Charles R Greathouse IV_, Oct 14 2010
%F A169986 a(n) = 3*Fibonacci(n-1) + Fibonacci(n-2) + (n mod 2), n>0. - _Gary Detlefs_, Dec 29 2010
%F A169986 G.f.: (-x+x^2+x^3+x^4-1) / ((1-x)*(1+x)*(x^2+x-1)). - _R. J. Mathar_, Jan 06 2011
%F A169986 a(2k) = A000032(2k) = A169985(2k) and a(2k+1) = A000032(2k+1)+1 = A169985(2k+1)+1, for k>0. - _Danny Rorabaugh_, Apr 15 2015
%t A169986 Ceiling[GoldenRatio^Range[0,40]] (* or *) Join[{1},LinearRecurrence[{1,2,-1,-1},{2,3,5,7},40]] (* _Harvey P. Dale_, Nov 12 2014 *)
%o A169986 (Magma) [1] cat [3*Fibonacci(n-1) + Fibonacci(n-2)+ n mod 2: n in [1..40]]; // _Vincenzo Librandi_, Apr 16 2015
%o A169986 (Sage) [ceil(golden_ratio^n) for n in range(37)] # _Danny Rorabaugh_, Apr 16 2015
%o A169986 (PARI) a(n)=if(n, 3*fibonacci(n-1) + fibonacci(n-2) + n%2, 1) \\ _Charles R Greathouse IV_, Apr 16 2015
%Y A169986 Cf. A001622, A014217, A062724, A169985.
%K A169986 nonn,easy
%O A169986 0,2
%A A169986 _N. J. A. Sloane_, Sep 26 2010