Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122553
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122553 a(0)=1, a(n)=3 for n>0. +0
5
1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3 (list; graph; listen)
OFFSET

0,2

COMMENT

Continued fraction for ((sqrt(13)-1))/2.

FORMULA

a(n)=3-2*0^n . G.f. : (1+2*x)/(1-x) . Sum_{n, n>=0}a(n)*10^(-n)=4/3.

CROSSREFS

Adjacent sequences: A122550 A122551 A122552 this_sequence A122554 A122555 A122556

Sequence in context: A135203 A102818 A010701 this_sequence A032552 A087717 A053444

KEYWORD

nonn,cofr

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 20 2006

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 October 12 11:54 EDT 2008. Contains 144829 sequences.


AT&T Labs Research