|
| |
| |
|
|
|
3, 9, 27, 57, 99, 153, 219, 297, 387, 489, 603, 729, 867, 1017, 1179, 1353, 1539, 1737, 1947, 2169, 2403, 2649, 2907, 3177, 3459, 3753, 4059, 4377, 4707, 5049, 5403, 5769, 6147, 6537, 6939, 7353, 7779, 8217, 8667, 9129, 9603, 10089, 10587, 11097, 11619
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| a(n) is also the number of Arnoux-Rauzy factors of length (n+1) over a 3-letter alphabet. [From Genevieve Paquin (genevieve.paquin(AT)univ-savoie.fr), Nov 07 2008]
|
|
|
REFERENCES
| F. Mignosi and L. Q. Zamboni, On the number of Arnoux-Rauzy words, Acta arith., 101 (2002), no. 2, 121-129 [From Genevieve Paquin (genevieve.paquin(AT)univ-savoie.fr), Nov 07 2008]
|
|
|
LINKS
| Index entries for sequences related to linear recurrences with constant coefficients, signature (3,-3,1).
Harvey P. Dale, Table of n, a(n) for n = 0..1000
|
|
|
FORMULA
| a(0)=3, a(n+1)=a(n)+75. - Robert G. Wilson v
a(0)=3, a(1)=9, a(2)=27, a(n)=3*a(n-1)-3*a(n-2)+a(n-3) [From Harvey P. Dale, Dec 29 2011]
G.f.: -((3*(3*x^2+1))/(x-1)^3) [From Harvey P. Dale, Dec 29 2011]
|
|
|
MATHEMATICA
| Table[ 3(2*n^2 + 1), {n, 0, 44}] (from Robert G. Wilson v Aug 26 2004)
Table[3(25n + 1), {n, 0, 44}] (from Robert G. Wilson v Aug 26 2004)
3(2Range[0, 50]^2+1) (* or *) LinearRecurrence[{3, -3, 1}, {3, 9, 27}, 50] (* From Harvey P. Dale, Dec 29 2011 *)
|
|
|
CROSSREFS
| Cf. A097802.
Sequence in context: A093665 A093546 A015955 * A201202 A161712 A137368
Adjacent sequences: A097800 A097801 A097802 * A097804 A097805 A097806
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| George E. Antoniou (george.antoniou(AT)montclair.edu), Aug 25 2004
|
|
|
EXTENSIONS
| More terms from Robert G. Wilson v (rgwv(AT)rgwv.com) and Mark Hudson (mrmarkhudson(AT)hotmail.com), Aug 26 2004
|
| |
|
|
