The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A092263 a(1)=1, a(n+1)=ceiling(phi*a(n))+1 if a(n) is odd, a(n+1)=ceiling(phi*a(n)) if a(n) is even, where phi=(1+sqrt(5))/2. 0
 1, 3, 6, 10, 17, 29, 48, 78, 127, 207, 336, 544, 881, 1427, 2310, 3738, 6049, 9789, 15840, 25630, 41471, 67103, 108576, 175680, 284257, 459939, 744198, 1204138, 1948337, 3152477, 5100816, 8253294, 13354111, 21607407, 34961520, 56568928 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Closely related to A079472 for terms with an even row. - Thomas Baruchel, Jul 28 2005 LINKS FORMULA For n>1, a(n) = floor(phi^n*(14+6*sqrt(5))/10) -1 (1/10) {4*Lucas(n+3) - 2(-1)^[n/2] - (-1)^[(n-1)/2] - 15 }. - Ralf Stephan, Dec 02 2004 From Chai Wah Wu, Jan 23 2020: (Start) a(n) = 2*a(n-1) - a(n-2) + a(n-3) - a(n-5) for n > 5. G.f.: x*(x^2 + x + 1)/((x - 1)*(x^2 + 1)*(x^2 + x - 1)). (End) CROSSREFS Sequence in context: A005045 A189376 A069241 * A259968 A242525 A266617 Adjacent sequences:  A092260 A092261 A092262 * A092264 A092265 A092266 KEYWORD nonn AUTHOR Benoit Cloitre, Feb 18 2004 STATUS approved

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

Last modified May 10 00:50 EDT 2021. Contains 343747 sequences. (Running on oeis4.)