The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A080074 a(n) = round(126*phi^n). 1
 0, 1, 1, 2, 3, 4, 7, 11, 18, 30, 48, 78, 126, 204, 330, 534, 864, 1397, 2261, 3658, 5919, 9578, 15497, 25075, 40572, 65646, 106218, 171864, 278082, 449946, 728028, 1177974, 1906002, 3083976, 4989978, 8073954, 13063932, 21137886, 34201818, 55339704, 89541522, 144881226 (list; graph; refs; listen; history; text; internal format)
 OFFSET -12,4 COMMENTS Related to Le Corbusier's "modular" (or "modulor") numbers, see A080104. LINKS Vincenzo Librandi, Table of n, a(n) for n = -12..1100 EXAMPLE G.f. = x^-11 + x^-10 + 2*x^-9 + 3*x^-8 + 4*x^-7 + 7*x^-6 + 11*x^-5 + ... a(0) = 126. MAPLE A080074:=n->round(126*((1+sqrt(5))/2)^n): seq(A080074(n), n=-12..50); # Wesley Ivan Hurt, Jan 19 2017 MATHEMATICA Table[Round[126 GoldenRatio^n], {n, -12, 29}] (* Michael De Vlieger, Jan 20 2017 *) PROG (Magma) [Round(126*((1+Sqrt(5))/2)^n): n in [-12..50]]; // Vincenzo Librandi, Jan 21 2017 CROSSREFS Cf. A080104. Sequence in context: A169985 A254729 A293544 * A317767 A018064 A226161 Adjacent sequences: A080071 A080072 A080073 * A080075 A080076 A080077 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Mar 15 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 6 09:20 EST 2023. Contains 367600 sequences. (Running on oeis4.)