login
a(n) = round(126*phi^n).
1

%I #13 Sep 08 2022 08:45:09

%S 0,1,1,2,3,4,7,11,18,30,48,78,126,204,330,534,864,1397,2261,3658,5919,

%T 9578,15497,25075,40572,65646,106218,171864,278082,449946,728028,

%U 1177974,1906002,3083976,4989978,8073954,13063932,21137886,34201818,55339704,89541522,144881226

%N a(n) = round(126*phi^n).

%C Related to Le Corbusier's "modular" (or "modulor") numbers, see A080104.

%H Vincenzo Librandi, <a href="/A080074/b080074.txt">Table of n, a(n) for n = -12..1100</a>

%e G.f. = x^-11 + x^-10 + 2*x^-9 + 3*x^-8 + 4*x^-7 + 7*x^-6 + 11*x^-5 + ...

%e a(0) = 126.

%p A080074:=n->round(126*((1+sqrt(5))/2)^n): seq(A080074(n), n=-12..50); # _Wesley Ivan Hurt_, Jan 19 2017

%t Table[Round[126 GoldenRatio^n], {n, -12, 29}] (* _Michael De Vlieger_, Jan 20 2017 *)

%o (Magma) [Round(126*((1+Sqrt(5))/2)^n): n in [-12..50]]; // _Vincenzo Librandi_, Jan 21 2017

%Y Cf. A080104.

%K nonn,easy

%O -12,4

%A _N. J. A. Sloane_, Mar 15 2003