|
Search: id:A067902
|
|
|
| A067902 |
|
a(n) = 14*a(n-1) - a(n-2); a(0) = 2, a(1) = 14. |
|
+0
3
|
|
| 2, 14, 194, 2702, 37634, 524174, 7300802, 101687054, 1416317954, 19726764302, 274758382274, 3826890587534, 53301709843202, 742397047217294, 10340256951198914, 144021200269567502, 2005956546822746114
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Solves for x in x^2 - 3*y^2 = 4.
For n>0, a(n)+2 is the number of dimer tilings of a 4 X 2n Klein bottle (cf. A103999).
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
Index entries for recurrences a(n) = k*a(n - 1) +/- a(n - 2)
Zerinvary Lajos, Sage Notebooks
|
|
FORMULA
|
G.f.: 2*(1-7*x)/(1-14*x+x^2). - njas, Nov 22 2006
a(n) = p^n + q^n, where p = 7 + 4sqrt(3) and q = 7 - 4sqrt(3). - Tanya Khovanova (tanyakh(AT)yahoo.com), Feb 06 2007
|
|
MAPLE
|
a := proc(n) option remember: if n=0 then RETURN(2) fi: if n=1 then RETURN(14) fi: 14*a(n-1)-a(n-2): end: for n from 0 to 30 do printf(`%d, `, a(n)) od:
|
|
MATHEMATICA
|
a[0] = 2; a[1] = 14; a[n_] := 14a[n - 1] - a[n - 2]; Table[ a[n], {n, 0, 16}] (from Robert G. Wilson v Jan 30 2004)
|
|
PROGRAM
|
sage: [lucas_number2(n, 14, 1) for n in xrange(0, 20)] - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 26 2008
|
|
CROSSREFS
|
Cf. A067900.
Sequence in context: A109520 A000807 A074655 this_sequence A132611 A047796 A090300
Adjacent sequences: A067899 A067900 A067901 this_sequence A067903 A067904 A067905
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Lekraj Beedassy (blekraj(AT)yahoo.com), May 13 2003
|
|
EXTENSIONS
|
More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net) and James A. Sellers (sellersj(AT)math.psu.edu), May 19, 2003
|
|
|
Search completed in 0.002 seconds
|
