Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092263
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
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; listen)
OFFSET

1,2

COMMENT

Closely related to A079472 for terms with an even row. - Thomas Baruchel (baruchel(AT)users.sourceforge.net), Jul 28 2005

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 }. - R. Stephan, Dec 02 2004

CROSSREFS

Sequence in context: A094272 A005045 A069241 this_sequence A076251 A029864 A075111

Adjacent sequences: A092260 A092261 A092262 this_sequence A092264 A092265 A092266

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 18 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research