Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076899
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076899 Let u(1)=u(2)=u(3)=1, u(n)=sign(u(n-1)-u(n-2))/(u(n-3)+1); then a(n) is the denominator of u(n). +0
1
1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 3, 3, 1, 2, 2, 1, 5, 5, 1, 3, 3, 1, 8, 8, 1, 5, 5, 1, 13, 13, 1, 8, 8, 1, 21, 21, 1, 13, 13, 1, 34, 34, 1, 21, 21, 1, 55, 55, 1, 34, 34, 1, 89, 89, 1, 55, 55, 1, 144, 144, 1, 89, 89, 1, 233, 233, 1, 144, 144, 1, 377, 377, 1, 233, 233, 1, 610, 610, 1, 377 (list; graph; listen)
OFFSET

1,5

FORMULA

F(k) denotes the k-th Fibonacci number: a(6k)=F(k+2); a(6k+1)=1; a(6k+2)=a(6k+3)=F(k+1); a(6k+4)=1; a(6k+5)=F(k+3)

CROSSREFS

Sequence in context: A073741 A071838 A099245 this_sequence A096601 A078077 A078082

Adjacent sequences: A076896 A076897 A076898 this_sequence A076900 A076901 A076902

KEYWORD

frac,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 26 2002

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 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research