|
Search: id:A041085
|
|
|
| A041085 |
|
Denominators of continued fraction convergents to sqrt(50). |
|
+0
7
|
|
| 1, 14, 197, 2772, 39005, 548842, 7722793, 108667944, 1529074009, 21515704070, 302748930989, 4260000737916, 59942759261813, 843458630403298, 11868363584907985, 167000548819115088, 2349876047052519217
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
a(n) = round((7+5*sqrt(2))*a(n-1)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 15 2003
a(n)=A000129(3n+3)/5; a(n)=(1+sqrt(2))^(3n)(1/2+7sqrt(2)/20)+(1-sqrt(2))^(3n)(1/2-7sqrt(2)/20); a(n)=sum{i=0..n, sum{j=0..n, (n!/(i!j!(n-i-j)!)A000129(2n-i)/5}}. - Paul Barry (pbarry(AT)wit.ie), Feb 06 2004
a(n)=F(n, 14), the n-th Fibonacci polynomial evaluated at x=14. - T. D. Noe (noe(AT)sspectra.com), Jan 19 2006
a(n)=14*a(n-1)+a(n-2); a(0)=1, a(1)=14 . G.f.: 1/(1-14*x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 03 2008]
|
|
MAPLE
|
with (combinat):seq(fibonacci(3*n, 2)/5, n=1..17); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 20 2008
|
|
MATHEMATICA
|
a=0; lst={}; s=0; Do[a=s-(a-1); AppendTo[lst, a]; s+=a*14, {n, 3*4!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 27 2009]
|
|
CROSSREFS
|
Cf. A041084.
Sequence in context: A001023 A067221 A072533 this_sequence A124239 A041366 A051817
Adjacent sequences: A041082 A041083 A041084 this_sequence A041086 A041087 A041088
|
|
KEYWORD
|
nonn,cofr,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
