|
Search: id:A145051
|
|
|
| A145051 |
|
Numerator of the first convergent to the sqrt(n) using the recursion x = (n/x+x)/2. |
|
+0
1
|
|
| 1, 3, 2, 5, 3, 7, 4, 9, 5, 11, 6, 13, 7, 15, 8, 17, 9, 19, 10, 21, 11, 23, 12, 25, 13, 27, 14, 29, 15, 31, 16, 33, 17, 35, 18, 37, 19, 39, 20, 41, 21, 43, 22, 45, 23, 47, 24, 49, 25, 51, 26, 53, 27, 55, 28, 57, 29, 59, 30, 61, 31, 63, 32, 65, 33, 67, 34, 69, 35, 71, 36, 73, 37, 75
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
This is the same as A026741 without the first 2 terms in A026741. The link describes the experimental derivation of the generating function.
|
|
LINKS
|
Cino Hilliard, Roots by Recursion
|
|
FORMULA
|
Contribution from Paul Barry (pbarry(AT)wit.ie), Nov 22 2009: (Start)
G.f.: (1+3x-x^3)/(1-x^2)^2.
a(n)=(n+2)(3-(-1)^n)/4; a(n)=sum{k=0..n, if(k=floor(n/2) or k=floor((n+1)/2),1,0)*(k+1)}. (End)
|
|
EXAMPLE
|
n=1;x=1;x=(1/1+1)/2 = 1/1 n=2;x=1;x=(2/1+1)/2 = 3/1 n=3;x=1;x=(3/1+1)/2 = 2/1
|
|
MATHEMATICA
|
lst={}; Do[a=n^2+n; b=n^2-n; c=a/b; AppendTo[lst, Denominator[c]], {n, 2, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 20 2009]
|
|
PROGRAM
|
(PARI) g(n, p) = x=1; for(j=1, p, x=(n/x+x)/2; if(j==1, print1(numerator(x)", ")))
for(k=1, 100, g(k, 1))
|
|
CROSSREFS
|
Cf. A026741
Sequence in context: A165342 A076605 A030640 this_sequence A026741 A105658 A083242
Adjacent sequences: A145048 A145049 A145050 this_sequence A145052 A145053 A145054
|
|
KEYWORD
|
frac,nonn,new
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)hotmail.com), Sep 30 2008
|
|
|
Search completed in 0.002 seconds
|
