OFFSET
0,1
COMMENTS
Apart from the first term, this sequence also gives the ceiling of the powers of the golden ratio (cf. A169986). - Mohammad K. Azarian, Apr 14 2008
LINKS
Harry J. Smith, Table of n, a(n) for n = 0..400
FORMULA
a(n) = 3*Fibonacci(n-1) + Fibonacci(n-2) + (n mod 2), n > 0. - Gary Detlefs, Dec 29 2010
MATHEMATICA
Floor[GoldenRatio^Range[0, 40]]+1 (* Harvey P. Dale, Dec 18 2019 *)
PROG
(PARI) j=[]; for(n=0, 60, t=(1+sqrt(5))/2; j=concat(j, floor((t^n))+1)); j
(PARI) { default(realprecision, 200); t=(1 + sqrt(5))/2; p=1; for (n=0, 400, if (n, p*=t); write("b062724.txt", n, " ", p\1 + 1) ) } \\ Harry J. Smith, Aug 09 2009
CROSSREFS
KEYWORD
nonn
AUTHOR
Jason Earls, Jul 15 2001
STATUS
approved