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!)
A077998 Expansion of (1-x)/(1-2*x-x^2+x^3). 32

%I #108 Dec 15 2023 19:17:43

%S 1,1,3,6,14,31,70,157,353,793,1782,4004,8997,20216,45425,102069,

%T 229347,515338,1157954,2601899,5846414,13136773,29518061,66326481,

%U 149034250,334876920,752461609,1690765888,3799116465,8536537209,19181424995,43100270734,96845429254

%N Expansion of (1-x)/(1-2*x-x^2+x^3).

%C Let u(k), v(k), w(k) be defined by u(1)=1, v(1)=0, w(1)=0 and u(k+1)=u(k)+v(k)+w(k), v(k+1)=u(k)+v(k), w(k+1)=u(k); then {u(n)} = 1,1,3,6,14,31,... (A006356 with an extra initial 1), {v(n)} = 0,1,2,5,11,25,... (A006054 with its initial 0 deleted) and {w(n)} = {u(n)} prefixed by an extra 0 = this sequence with an extra initial 0. - _Benoit Cloitre_, Apr 05 2002 [Also u(k)^2+v(k)^2+w(k)^2 = u(2k). - _Gary W. Adamson_, Dec 23 2003]

%C Form the graph with matrix A=[1, 1, 1; 1, 0, 0; 1, 0, 1]. Then A077998 counts closed walks of length n at the vertex of degree 4. - _Paul Barry_, Oct 02 2004

%C a(n) is the number of Motzkin (n+2)-sequences with no flatsteps at ground level and whose height is <=2. For example, a(3)=6 counts UDUFD, UFDUD, UFFFD, UFUDD, UUDFD, UUFDD. - _David Callan_, Dec 09 2004

%C Number of compositions of n if there are two kinds of part 2. Example: a(3)=6 because we have (3),(1,2),(1,2'),(2,1),(2',1) and (1,1,1). Row sums of A105477. - _Emeric Deutsch_, Apr 09 2005

%C Diagonal sums of A056242. - _Paul Barry_, Dec 26 2007

%C Diagonal sums of triangle in A105306. - _Philippe Deléham_, Nov 16 2008

%C a(n) appears in the formula for the nonpositive powers of rho:= 2*cos(Pi/7), the ratio of the smaller diagonal in the heptagon to the side length s=2*sin(Pi/7), when expressed in the basis <1,rho,sigma>, with sigma:=rho^2-1, the ratio of the larger heptagon diagonal to the side length, as follows. rho^(-n) = a(n)*1 + a(n-1)*rho - C(n)*sigma, n>=0, with C(n)=A006054(n+1). Put a(-1):=0. See the Steinbach reference, and a comment under A052547.

%C The limit a(n+1)/a(n) for n -> infinity is sigma = rho^2-1, approximately 2.246979603. See a Nov 07 2013 comment on A006054 for the proof, and the preceding comment for rho and sigma and the P. Steinbach reference. - _Wolfdieter Lang_, Nov 07 2013

%C From _Greg Dresden_ and Aaron Zhou, Jun 15 2023: (Start)

%C a(n) is the number of ways to tile a skew double-strip of 3*n cells using all possible "trominos". Here is the skew double-strip corresponding to n=4, with 12 cells:

%C ___ ___ ___ ___ ___ ___

%C | | | | | | |

%C _|___|___|___|___|_ _|___|

%C | | | | | | |

%C |___|___|___|___|___|___|,

%C and here are the three possible "tromino" tiles, which can be rotated or reflected as needed:

%C ___ ___

%C | | | |

%C _|___|_ _____|___| ___________

%C | | | | | | | | | |

%C |___|___|, |___|___| , |___|___|___|.

%C As an example, here is one of the a(4) = 14 ways to tile the skew double-strip of 12 cells:

%C ___ ___ _______ _______

%C | | | | |

%C _| |_ |_____ |_ _|

%C | | | | |

%C |_______|_______|___|___|. (End)

%D Kenneth Edwards, Michael A. Allen, A new combinatorial interpretation of the Fibonacci numbers squared, Part II, Fib. Q., 58:2 (2020), 169-177.

%D Jay Kappraff, Beyond Measure, A Guided Tour Through Nature, Myth and Number, World Scientific, 2002.

%H Vincenzo Librandi, <a href="/A077998/b077998.txt">Table of n, a(n) for n = 0..1000</a>

%H Paul Barry, <a href="https://arxiv.org/abs/2104.01644">Centered polygon numbers, heptagons and nonagons, and the Robbins numbers</a>, arXiv:2104.01644 [math.CO], 2021.

%H S. Morier-Genoud, V. Ovsienko, and S. Tabachnikov, <a href="https://doi.org/10.1007/s00209-015-1520-x">Introducing supersymmetric frieze patterns and linear difference operators</a>, Math. Z. 281 (2015) 1061.

%H P. Steinbach, <a href="http://www.jstor.org/stable/2691048">Golden fields: a case for the heptagon</a>, Math. Mag. 70 (1997), no. 1, 22-31.

%H Alexey Ustinov, <a href="http://arxiv.org/abs/1503.04497">Supercontinuants</a>, arXiv:1503.04497 [math.NT], 2015.

%H Floor van Lamoen, <a href="http://home.wxs.nl/~lamoen/wiskunde/wave.htm">Wave sequences</a>

%H R. Witula, D. Slota, and A. Warzynski, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL9/Slota/slota57.html">Quasi-Fibonacci Numbers of the Seventh Order</a>, J. Integer Seq., 9 (2006), Article 06.4.3.

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (2,1,-1).

%F a(0)=a(1)=1, a(2)=3, a(n+1) = 2*a(n) + a(n-1) - a(n-2) for n>=2. - _Philippe Deléham_, Sep 07 2006

%F 7*a(n) = (s(2))^2*(1+c(1))^n + (s(4))^2*(1+c(2))^n + (s(1))^2(1+c(4))^n, where c(j) = 2*Cos(2Pi*j/7) and s(j) = 2*Sin(2Pi*j/7) - for the proof of this one and many other relations for the sequences u(k), v(k) and w(k) defined on the top of the comments by _Benoit Cloitre_ - see Witula et al.'s paper. - _Roman Witula_, Aug 07 2012

%F a(n) = b(n+2)- b(n+1), first differences of b(n) = A006054(n). - _Wolfdieter Lang_, Nov 07 2013; corrected by _Kai Wang_, May 31 2017

%F a(n) = A096976(-n) for all n in Z. - _Michael Somos_, Dec 12 2023

%e G.f. = 1 + x + 3*x^2 + 6*x^3 + 14*x^4 + 31*x^5 + 70*x^6 + 157*x^7 + 353*x^8 + ... - _Michael Somos_, Dec 12 2023

%t CoefficientList[Series[(1-x)/(1-2*x-x^2+x^3), {x, 0, 40}], x] (* _Stefan Steinerberger_, Sep 11 2006 *)

%t LinearRecurrence[{2,1,-1},{1,1,3},40] (* _Roman Witula_, Aug 07 2012 *)

%t a[ n_] := {1, 0, 0} . MatrixPower[{{0, 1, 0}, {0, 0, 1}, {-1, 1, 2}}, n] . {1, 1, 3}; (* _Michael Somos_, Dec 12 2023 *)

%o (PARI) a(n)=([0,1,0; 0,0,1; -1,1,2]^n*[1;1;3])[1,1] \\ _Charles R Greathouse IV_, May 10 2016

%o (Magma) I:=[1,1,3]; [n le 3 select I[n] else 2*Self(n-1)+Self(n-2)-Self(n-3): n in [1..40]]; // _Vincenzo Librandi_, Jun 01 2017

%o (SageMath) ((1-x)/(1-2*x-x^2+x^3)).series(x, 40).coefficients(x, sparse=False) # _G. C. Greubel_, Jun 27 2019

%o (GAP) a:=[1,1,3];; for n in [4..40] do a[n]:=2*a[n-1]+a[n-2]-a[n-3]; od; a; # _G. C. Greubel_, Jun 27 2019

%Y Apart from initial term, same as A006356, which is the main entry for this sequence. A106803 is yet another version.

%Y Cf. A096976, A105477.

%K nonn,easy

%O 0,3

%A _N. J. A. Sloane_, Nov 17 2002

%E Edited by _N. J. A. Sloane_, Aug 08 2008 at the suggestion of _R. J. Mathar_

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 March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)