The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 12 17:17 EDT 2024. Contains 372492 sequences. (Running on oeis4.)