The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094433 a(n) is the left term in M^n * [1 0 0], M = the 3 X 3 matrix [1 -1 0 / -1 3 -2 / 0 -2 2]. 4
1, 1, 2, 6, 24, 108, 504, 2376, 11232, 53136, 251424, 1189728, 5629824, 26640576, 126064512, 596543616, 2822874624, 13357986048, 63210668544, 299116094976, 1415432558592, 6697898781696, 31694797338624, 149981391341568, 709719564017664, 3358429036056576 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Right term of M^n * [1 0 0] = A094434(n).
a(n)/a(n-1) tends to 3 + sqrt(3) = 4.732050807... (A165663).
A094434(n)/a(n) tends to 1 + sqrt(3) = 2.732050807... (A090388).
M is a "stiffness matrix" with k1 = 1, k2 = 2; in K = [k1 -k1 0 / -k1 (k1 + k2) -k2 / 0 -k2 k2], where K relates to Hooke's Law governing the force on nodes of springs resulting from stretching or compressing the springs (see A094431).
The eigenvalues of M are 3+sqrt(3), 3-sqrt(3) and 0. - Tamas Kalmar-Nagy (integers(AT)kalmarnagy.com), Mar 23 2008
a(n) is the number of permutations of length n+1 avoiding the partially ordered pattern (POP) {1>2, 1>3, 1>4, 5>2, 5>3, 5>4} of length 5. That is, the number of length n+1 permutations having no subsequences of length 5 in which the elements in positions 1 and 5 are larger than the elements in positions 2, 3 and 4. - Sergey Kitaev, Dec 11 2020
REFERENCES
Carl D. Meyer, "Matrix Analysis and Applied Linear Algebra", SIAM, 2000, p. 86-87.
LINKS
Alice L. L. Gao and Sergey Kitaev, On partially ordered patterns of length 4 and 5 in permutations, arXiv:1903.08946 [math.CO], 2019.
Alice L. L. Gao and Sergey Kitaev, On partially ordered patterns of length 4 and 5 in permutations, The Electronic Journal of Combinatorics 26(3) (2019), P3.26.
Sergey Kitaev and Artem Pyatkin, On permutations avoiding partially ordered patterns defined by bipartite graphs, arXiv:2204.08936 [math.CO], 2022.
FORMULA
a(n) = (3+sqrt(3))^(n-2) + (3-sqrt(3))^(n-2). - Tamas Kalmar-Nagy (integers(AT)kalmarnagy.com), Mar 23 2008 [Corrected by R. J. Mathar, Mar 28 2010, Jun 02 2010]
G.f.: 1 + x*(1-4*x)/(1-6*x+6*x^2). - R. J. Mathar, Mar 28 2010
EXAMPLE
a(4) = 24 since M^4 * [1 0 0] = [24 -84 60].
G.f. = 1 + x + 2*x^2 + 6*x^3 + 24*x^4 + 108*x^5 + 504*x^6 + 2376*x^7 + ...
MAPLE
a:= n-> (<<1|-1|0>, <-1|3|-2>, <0|-2|2>>^n)[1$2]:
seq(a(n), n=0..28); # Alois P. Heinz, Dec 11 2020
MATHEMATICA
Table[(MatrixPower[{{1, -1, 0}, {-1, 3, -2}, {0, -2, 2}}, n].{1, 0, 0})[[1]], {n, 24}] (* Robert G. Wilson v *)
Table[(3 + Sqrt[3])^n + (3 - Sqrt[3])^n, {n, 0, 20}] // Simplify (* Tamas Kalmar-Nagy (integers(AT)kalmarnagy.com), Mar 23 2008 *)
Rest@ CoefficientList[Series[x (1 - 4 x)/(1 - 6 x + 6 x^2), {x, 0, 23}], x] (* Michael De Vlieger, May 01 2019 *)
PROG
(Sage) [lucas_number2(n, 6, 6)for n in range(-1, 23)] # Zerinvary Lajos, Jul 08 2008
CROSSREFS
Sequence in context: A327006 A163824 A356782 * A178594 A277248 A189840
KEYWORD
nonn,easy
AUTHOR
Gary W. Adamson, May 02 2004
EXTENSIONS
More terms from Robert G. Wilson v, May 08 2004
a(0)=1 prepended by Alois P. Heinz, Dec 11 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 1 03:15 EDT 2024. Contains 373008 sequences. (Running on oeis4.)