A120757 -id:A120757 - cp's OEIS frontend

A006053 a(n) = a(n-1) + 2*a(n-2) - a(n-3), with a(0) = a(1) = 0, a(2) = 1.

0, 0, 1, 1, 3, 4, 9, 14, 28, 47, 89, 155, 286, 507, 924, 1652, 2993, 5373, 9707, 17460, 31501, 56714, 102256, 184183, 331981, 598091, 1077870, 1942071, 3499720, 6305992, 11363361, 20475625, 36896355, 66484244, 119801329, 215873462, 388991876, 700937471

Offset: 0

N. J. A. Sloane

a(n+1) = S(n) for n>=1, where S(n) is the number of 01-words of length n, having first letter 1, in which all runlengths of 1's are odd. Example: S(4) counts 1000, 1001, 1010, 1110. See A077865. - Clark Kimberling, Jun 26 2004
For n>=1, number of compositions of n into floor(j/2) kinds of j's (see g.f.). - Joerg Arndt, Jul 06 2011
Counts walks of length n between the first and second nodes of P_3, to which a loop has been added at the end. Let A be the adjacency matrix of the graph P_3 with a loop added at the end. A is a 'reverse Jordan matrix' [0,0,1; 0,1,1; 1,1,0]. a(n) is obtained by taking the (1,2) element of A^n. - Paul Barry, Jul 16 2004
Interleaves A094790 and A094789. - Paul Barry, Oct 30 2004
a(n) appears in the formula for the nonnegative 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 = C(n)*1 + C(n+1)*rho + a(n)*sigma, n>=0, with C(n) = A052547(n-2). See the Steinbach reference, and a comment under A052547. - Wolfdieter Lang, Nov 25 2010
If with the above notations the power basis <1,rho,rho^2> of Q(rho) is used, nonnegative powers of rho are given by rho^n  = -a(n-1)*1 + A052547(n-1)*rho + a(n)*rho^2. For negative powers see A006054. - Wolfdieter Lang, May 06 2011
-a(n-1) also appears in the formula for the nonpositive powers of sigma (see the above comment for the definition, and the Steinbach basis <1,rho,sigma>) as follows: sigma^(-n) = A(n)*1 -a(n+1)*rho -A(n-1)*sigma, with A(n) = A052547(n), A(-1):=0. - Wolfdieter Lang, Nov 25 2010

			G.f. = x^2 + x^3 + 3*x^4 + 4*x^5 + 9*x^6 + 14*x^7 + 28*x^8 + 47*x^9 + ...
Regarding the description "number of compositions of n into floor(j/2) kinds of j's," the a(6)=9 compositions of 6 are (2a, 2a, 2a), (3a, 3a), (2a, 4a), (2a, 4b), (4a, 2a), (4b, 2a), (6a), (6b), (6c). - _Bridget Tenner_, Feb 25 2022

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. Witula, E. Hetmaniok and D. Slota, Sums of the powers of any order roots taken from the roots of a given polynomial, Proceedings of the 15th International Conference on Fibonacci Numbers and Their Applications (2012).

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Robin Chapman and Nicholas C. Singer, Eigenvalues of a bidiagonal matrix, Amer. Math. Monthly, 111 (2004), p. 441.
Nachum Dershowitz, Between Broadway and the Hudson: A Bijection of Corridor Paths, arXiv:2006.06516 [math.CO], 2020.
Tomislav Došlić, Mate Puljiz, Stjepan Šebek, and Josip Žubrinić, On a variant of Flory model, arXiv:2210.12411 [math.CO], 2022.
Jia Huang, A coin flip game and generalizations of Fibonacci numbers, arXiv:2501.07463 [math.CO], 2025. See p. 9.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 433
Mohammed L. Nadji, Moussa Ahmia, Daniel F. Checa, and José L. Ramírez, Arndt Compositions with Restricted Parts, Palindromes, and Colored Variants, J. Int. Seq. (2025) Vol. 28, Issue 3, Article 25.3.6. See p. 11.
László Németh and Dragan Stevanović, Graph solution of system of recurrence equations, Research Gate, 2023. See Table 2 at p. 6.
László Németh and László Szalay, Sequences Involving Square Zig-Zag Shapes, J. Int. Seq., Vol. 24 (2021), Article 21.5.2.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
R. Sachdeva and A. K. Agarwal, Combinatorics of certain restricted n-color composition functions, Discrete Mathematics, 340, (2017), 361-372.
Genki Shibukawa, New identities for some symmetric polynomials and their applications, arXiv:1907.00334 [math.CA], 2019.
P. Steinbach, Golden fields: a case for the heptagon, Math. Mag. 70 (1997), no. 1, 22-31.
Kai Wang, Fibonacci Numbers And Trigonometric Functions Outline, (2019).
Roman Witula, Ramanujan Type Trigonometric Formulas: The General Form for the Argument 2Pi/7, J. Integer Seq., 12 (2009), Article 09.8.5.
Index entries for linear recurrences with constant coefficients, signature (1,2,-1).

Cf. A006054, A052547, A077865, A094789, A094790, A096975, A096976.

Cf. A120757, A187065, A187066, A187067, A214683, A215076, A215100.

a006053 n = a006053_list !! n
a006053_list = 0 : 0 : 1 : zipWith (+) (drop 2 a006053_list)
   (zipWith (-) (map (2 *) $ tail a006053_list) a006053_list)
-- Reinhard Zumkeller, Oct 14 2011

[ n eq 1 select 0 else n eq 2 select 0 else n eq 3 select 1 else Self(n-1) +2*Self(n-2) -Self(n-3): n in [1..40] ]; // Vincenzo Librandi, Aug 19 2011

a[0]:=0: a[1]:=0: a[2]:=1: for n from 3 to 40 do a[n]:=a[n-1]+2*a[n-2]-a[n-3] od:seq(a[n], n=0..40); # Emeric Deutsch
A006053:=z**2/(1-z-2*z**2+z**3); # conjectured by Simon Plouffe in his 1992 dissertation

LinearRecurrence[{1,2,-1}, {0,0,1}, 50]  (* Vladimir Joseph Stephan Orlovsky, May 25 2011 *)

{a(n) = if( n<0, n = -1-n; polcoeff( -1 / (1 - 2*x - x^2 + x^3) + x * O(x^n), n), polcoeff( x^2 / (1 - x - 2*x^2 + x^3) + x * O(x^n), n))}; /* Michael Somos, Nov 30 2014 */

@CachedFunction
def a(n): # a = A006053
    if (n<3): return (n//2)
    else: return a(n-1) + 2*a(n-2) - a(n-3)
[a(n) for n in range(41)] # G. C. Greubel, Feb 12 2023

G.f.: x^2/(1 - x - 2*x^2 + x^3). - Emeric Deutsch, Dec 14 2004
a(n) = c^(n-2) - a(n-1)*(c-1) + (1/c)*a(n-2) for n > 3 where c = 2*cos(Pi/7). Example: a(7) = 14 = c^5 - 9*(c-1) + 4/c = 18.997607... - 7.21743962... + 2.219832528... - Gary W. Adamson, Jan 24 2010
G.f.: -1 + 1/(1 - Sum_{j>=1} floor(j/2)*x^j). - Joerg Arndt, Jul 06 2011
a(n+2) = A094790(n/2+1)*(1+(-1)^n)/2 + A094789((n+1)/2)*(1-(-1)^n)/2. - Paul Barry, Oct 30 2004
First differences of A028495. - Floor van Lamoen, Nov 02 2005
a(n) = A187065(2*n+1); a(n+1) = A187066(2*n+1) = A187067(2*n). - L. Edson Jeffery, Mar 16 2011
a(n) = 2^n*(c(1)^(n-1)*(c(1)+c(2)) + c(3)^(n-1)*(c(3)+c(6)) + c(5)^(n-1)*(c(5)+c(4)) )/7, with c(j):=cos(Pi*j/7). - Herbert Kociemba, Dec 18 2011
a(n+1)*(-1)^n*49^(1/3) = (c(1)/c(4))^(1/3)*(2*c(1))^n + (c(2)/c(1))^(1/3)*(2*c(2))^n + (c(4)/c(2))^(1/3)*(2c(4))^n = (c(2)/c(1))^(1/3)*(2*c(1))^(n+1) + (c(4)/c(2))^(1/3)*(c(2))^(n+1) + (c(1)/c(4))^(1/3)*(2*c(4))^(n+1), where c(j) := cos(2Pi*j/7); for the proof, see Witula et al.'s papers. - Roman Witula, Jul 21 2012
The previous formula connects the sequence a(n) with A214683, A215076, A215100, A120757. We may call a(n) the Ramanujan-type sequence number 2 for the argument 2*Pi/7. - Roman Witula, Aug 02 2012
a(n) = -A006054(1-n) for all n in Z. - Michael Somos, Nov 30 2014
G.f.: x^2 / (1 - x / (1 - 2*x / (1 + 5*x / (2 - x / (5 - 2*x))))). - Michael Somos, Jan 20 2017
a(n) ~ r*c^n, where r=0.241717... is one of the roots of 49*x^3-7*x+1, and c=2*cos(Pi/7) (as in Gary W. Adamson's formula). - Daniel Checa, Nov 04 2022
a(2n-1) = 2*a(n+1)*a(n) - a(n)^2 - a(n-1)^2. - Richard Peterson, May 25 2023

More terms from Emeric Deutsch, Dec 14 2004

Typo in definition fixed by Reinhard Zumkeller, Oct 14 2011

A085810 Number of three-choice paths along a corridor of height 5, starting from the lower side.

Original entry on oeis.org

1, 2, 5, 13, 35, 96, 266, 741, 2070, 5791, 16213, 45409, 127206, 356384, 998509, 2797678, 7838801, 21963661, 61540563, 172432468, 483144522, 1353740121, 3793094450, 10628012915, 29779028189, 83438979561, 233790820762, 655067316176, 1835457822857, 5142838522138, 14409913303805

Offset: 1

Philippe Deléham, Jul 25 2003

From Svjetlan Feretic, Jun 01 2013: (Start)
A three-choice path is a path whose steps lie in the set {(1,1), (1,0), (1,-1)}.
The paths under consideration "live" in a corridor like 0<=y<=5. Thus, the ordinate of a vertex of a path can take six values (0,1,2,3,4,5), but the height of the corridor is five.
a(1)=1 is the number of paths with zero steps, a(2)=2 is the number of paths with one step, a(3)=5 is the number of paths with two steps, ...
Narrower corridors produce A000012, A000079, A000129, A001519, A057960. An infinitely wide corridor would produce A005773.
(End)
Diagonal sums of A114164. - Paul Barry, Nov 15 2005
C(n):= a(n)*(-1)^n appears in the following formula for the nonpositive powers of rho*sigma, where rho:=2*cos(Pi/7) and sigma:=sin(3*Pi/7)/sin(Pi/7) = rho^2-1 are the ratios of the smaller and larger diagonal length to the side length in a regular 7-gon (heptagon). See the Steinbach reference where the basis  <1,rho,sigma> is used in an extension of the rational field. (rho*sigma)^(-n) = C(n) + B(n)*rho + A(n)*sigma,n>=0, with B(n)= A181880(n-2)*(-1)^n, and A(n)= A116423(n+1)*(-1)^(n+1). For the nonnegative powers see A120757(n), |A122600(n-1)| and A181879(n), respectively. See also a comment under A052547.
a(n) is also the number of bi-wall directed polygons with n cells. (The definition of bi-wall directed polygons is given in the article on A122737.)

G. C. Greubel, Table of n, a(n) for n = 1..1000
Svjetlan Feretic, Generating functions for bi-wall directed polygons, in: Proc. of the Seventh Int. Conf. on Lattice Path Combinatorics and Applications (eds. S. Rinaldi and S. G. Mohanty), Siena, 2010, 147-151.
Peter Steinbach, Golden fields: a case for the heptagon, Math. Mag. 70 (1997), p. 22-31 (formula 5).
Roman Witula, Damian Slota and Adam Warzynski, Quasi-Fibonacci Numbers of the Seventh Order, J. Integer Seq., 9 (2006), Article 06.4.3.
Index entries for linear recurrences with constant coefficients, signature (4,-3,-1).

Cf. A000012, A000079, A000129, A001519, A057960, A005773.

I:=[1,2,5]; [n le 3 select I[n] else 4*Self(n-1)-3*Self(n-2)-Self(n-3): n in [1..35]]; // Vincenzo Librandi, Sep 18 2015

LinearRecurrence[{4,-3,-1}, {1,2,5}, 50] (* Roman Witula, Aug 09 2012 *)
CoefficientList[Series[(1 - 2 x)/(1 - 4 x + 3 x^2 + x^3), {x, 0, 40}], x] (* Vincenzo Librandi, Sep 18 2015 *)

x='x+O('x^30); Vec((1-2*x)/(1-4*x+3*x^2+x^3)) \\ G. C. Greubel, Apr 19 2018

a(n) = 4*a(n-1) - 3*a(n-2) - a(n-3).
From Paul Barry, Nov 15 2005: (Start)
G.f.: (1-2*x)/(1-4*x+3*x^2+x^3).
a(n) = Sum_{k=0..floor(n/2)} (Sum_{j=0..n-k} C(n-k, j)*C(j+k, 2k));
a(n) = Sum_{k=0..floor(n/2)} (Sum_{j=0..n-k} C(n-k, k+j)*C(k, k-j)*2^(n-2k-j));
a(n) = Sum_{k=0..floor(n/2)} (Sum_{j=0..n-2*k} C(n-j, n-2*k-j)*C(k, j)(-1)^j*2^(n-2*k-j)). (End)
a(n-1) = -B(n;-1) = (1/7)*((c(4)-c(1))*(1-c(1))^n + (c(1)-c(2))*(1-c(2))^n + (c(2)-c(4))*(1-c(4))^n), where a(-1):=0, c(j):=2*cos(2*Pi*j/7). Moreover, B(n;d), n in N, d in C, denotes the respective quasi-Fibonacci number defined in comments to A121449 or in Witula-Slota-Warzynski's paper (see also A077998, A006054, A052975, A094789, A121442). - Roman Witula, Aug 09 2012

Name corrected and clarified, and offset 1 from Svjetlan Feretic, Jun 01 2013

A122600 Expansion of 1/(1 + 3x - 4x^2 + x^3).

Original entry on oeis.org

1, -3, 13, -52, 211, -854, 3458, -14001, 56689, -229529, 929344, -3762837, 15235416, -61686940, 249765321, -1011279139, 4094585641, -16578638800, 67125538103, -271785755150, 1100438056662, -4455582728689, 18040286167865, -73043627475013, 295747609825188, -1197457625543481

Offset: 0

Roger L. Bagula and Gary W. Adamson, Sep 20 2006

Suggested by the Steinbach heptagon polynomial p^3 - 2*p^2*(1 - p) - p(1 - p)^2 + (1 - p)^3 = (1 - 4 p + 3 p^2 + p^3).

B(n):=|a(n-1)| = a(n-1)*(-1)^(n-1) with B(0):=0 (hence the o.g.f. for B(n) is x/(1 + 3*x - 4*x^2 + x^3)) appears in the following formula for the nonnegative powers of rho*sigma, where rho:=2*cos(Pi/7) and sigma:=sin(3*Pi/7)/sin(Pi/7)= rho^2-1 are the ratios of the smaller and larger diagonal length to the side length in a regular 7-gon (heptagon). See the Steinbach reference where the basis <1,rho,sigma> is used in an extension of the rational field. (rho*sigma)^n = C(n) + B(n)*rho + A(n)*sigma,n>=0, with C(n)= A120757(n) with C(0):=1, and A(n)= A181879(n). For the nonpositive powers see A085810*(-1)^n, A181880(n) and A116423(n)*(-1)^n, respectively. See also a comment under A052547.

Toufik Mansour and Mark Shattuck, Avoidance of vincular patterns by flattened derangements, arXiv:2504.14713 [math.CO], 2025. See p. 6.
Peter Steinbach, Golden fields: a case for the heptagon, Math. Mag. 70 (1997), no. 1, 22-31.
Index entries for linear recurrences with constant coefficients, signature (-3,4,-1).

Cf. A065941.

p[x_] := 1 - 4 x + 3x^2 + x^3; q[x_] := ExpandAll[x^3*p[1/x]]; Table[ SeriesCoefficient[ Series[x/q[x], {x, 0, 30}], n], {n, 0, 30}]
CoefficientList[Series[1/(1 + 3*x - 4*x^2 + x^3), {x, 0, 50}], x] (* or *) LinearRecurrence[{-3, 4, -1}, {1, -3, 13}, 40] (* Vladimir Joseph Stephan Orlovsky, Jan 31 2012 *)

a(n)= -3*a(n-1) + 4*a(n-2) - a(n-3), n>=2, a(-1):=0, a(1)=0, a(1)=-3 (from the o.g.f. given in the name).
a(n) = (-1)^n*Sum_{k=0..n} binomial(n+k+2,3*k+2)*7^k. - Emanuele Munarini, Aug 27 2017
From Kai Wang, Jul 05 2020: (Start)
a(n) =  Sum_{i+2j+3k=n} (-1)^(i+k)*3^i*4^j*((i+j+k)!)/(i!*j!*k!).
a(n) = (-1)^n*(6*A215076(n+4) - 21*A215076(n+3) - 13*A215076(n+2))/7. (End)

Edited by N. J. A. Sloane, Feb 01 2007

A215100 a(n) = 3a(n-1) + 4a(n-2) + a(n-3) with a(0)=2, a(1)=5, a(2)=22.

Original entry on oeis.org

2, 5, 22, 88, 357, 1445, 5851, 23690, 95919, 388368, 1572470, 6366801, 25778651, 104375627, 422608286, 1711106017, 6928126822, 28051412820, 113577851765, 459867333397, 1861964820071, 7538941645566, 30524551550379, 123591386053472, 500411306007498, 2026124013786761

Offset: 0

Roman Witula, Aug 03 2012

Ramanujan-type sequence number 4 for the argument 2*Pi/7. We have a(n)=bs(3n+2), where the sequence bs(n) and its two conjugate sequences as(n) and cs(n) are defined in the comments to A214683 (see also A215076, A120757, A006053). Since we also have as(3n+2)=cs(3n+2)=0 from the formula for S(n) (see Comments at A214683) we obtain the relation 7^(1/3)*a(n)= (c(1)/c(4))^(n + 2/3) + (c(4)/c(2))^(n + 2/3) + (c(2)/c(1))^(n + 2/3).

			From 4*a(2) = a(3) = 88 we get 88*7^(1/3) = 4*((c(1)/c(4))^(8/3) + (c(4)/c(2))^(8/3) + (c(2)/c(1))^(8/3))=(c(1)/c(4))^(11/3) + (c(4)/c(2))^(11/3) + (c(2)/c(1))^(11/3).

R. Witula, E. Hetmaniok and D. Slota, Sums of the powers of any order roots taken from the roots of a given polynomial, Proceedings of the Fifteenth International Conference on Fibonacci Numbers and Their Applications, Eger, Hungary, 2012.

G. C. Greubel, Table of n, a(n) for n = 0..1000
Roman Witula, Ramanujan Type Trigonometric Formulas: The General Form for the Argument 2*Pi/7, Journal of Integer Sequences, Vol. 12 (2009), Article 09.8.5.
Roman Witula, Full Description of Ramanujan Cubic Polynomials, Journal of Integer Sequences, Vol. 13 (2010), Article 10.5.7.
Roman Witula, Ramanujan Cubic Polynomials of the Second Kind, Journal of Integer Sequences, Vol. 13 (2010), Article 10.7.5.
Roman Witula, Ramanujan Type Trigonometric Formulae, Demonstratio Math. 45 (2012) 779-796.
Index entries for linear recurrences with constant coefficients, signature (3,4,1).

Cf. A006053, A214683, A215076, A120757.

I:=[2,5,22]; [n le 3 select I[n] else 3*Self(n-1) +4*Self(n-2) +Self(n-3): n in [1..41]]; // G. C. Greubel, Nov 25 2022

LinearRecurrence[{3, 4, 1}, {2, 5, 22}, 40]

Vec((2-x-x^2)/(1-3*x-4*x^2-x^3) + O(x^40)) \\ Michel Marcus, Apr 20 2016

@CachedFunction
def a(n): # a = A215100
    if (n<3): return (2,5,22)[n]
    else: return 3*a(n-1) + 4*a(n-2) + a(n-3)
[a(n) for n in range(41)] # G. C. Greubel, Nov 25 2022

G.f.: (2 - x - x^2)/(1 - 3*x - 4*x^2 - x^3).

More terms from Michel Marcus, Apr 20 2016

A215560 a(n) = 3a(n-1) + 46a(n-2) + a(n-3) with a(0)=a(1)=3, a(2)=101.

Original entry on oeis.org

3, 3, 101, 444, 5981, 38468, 390974, 2948431, 26868565, 216624495, 1888775906, 15657923053, 134074085330, 1124375492334, 9556192325235, 80523923708399, 682280993578341, 5760499663646612, 48746948619251921, 411906111379078256, 3483838470286469746, 29447943482916260935

Offset: 0

Roman Witula, Aug 16 2012

The Ramanujan-type sequence number 6 for the argument 2Pi/7 (see also A214683, A215112, A006053, A006054, A215076, A215100, A120757 for the numbers: 1, 1a, 2, 2a, 3, 4 and 5 respectively).
The sequence a(n) is one of the three special sequences (the remaining two are A215569 and A215572) connected with the following recurrence relation: T(n):=49^(1/3)*T(n-2)+T(n-3), with T(0)=3, T(1)=0, and T(2)=2*49^(1/3) - see the comments to A214683.
It can be proved that
T(n) = (c(1)^4/c(2))^(n/3) + (c(2)^4/c(4))^(n/3) + (c(4)^4/c(1))^(n/3), where c(j):=2*cos(2*Pi*j/7), and the following decomposition hold true:
T(n) = at(n) + bt(n)*7^(1/3) + ct(n)*49^(1/3), where sequences at(n), bt(n), and ct(n) satisfy the following system of recurrence equations: at(n)=7*bt(n-2)+at(n-3),
bt(n)=7*ct(n-2)+bt(n-3), ct(n)=at(n-2)+ct(n-3), with at(0)=3, at(1)=at(2)=bt(0)=bt(1)=bt(2)=ct(0)=ct(1)=0, ct(2)=2 - for details see the first Witula reference.
It follows that a(n)=at(3*n), bt(3*n)=ct(3*n)=0.
Every difference of the form a(n)-a(n-2)-a(n-3) is divisible by 3. Because the difference a(n+1)-a(n) is congruent to the difference a(n-4)-a(n-2) modulo 3 we easily deduce that a(6)-a(5) and a(7)-a(6)-2 are both divisible by 3.

R. Witula, E. Hetmaniok, D. Slota, Sums of the powers of any order roots taken from the roots of a given polynomial, Proceedings of the Fifteenth International Conference on Fibonacci Numbers and Their Applications, Eger, Hungary, 2012

Roman Witula, Ramanujan Type Trigonometric Formulas: The General Form for the Argument 2*Pi/7, Journal of Integer Sequences, Vol. 12 (2009), Article 09.8.5.
Roman Witula, Full Description of Ramanujan Cubic Polynomials, Journal of Integer Sequences, Vol. 13 (2010), Article 10.5.7.
Roman Witula, Ramanujan Cubic Polynomials of the Second Kind, Journal of Integer Sequences, Vol. 13 (2010), Article 10.7.5.
Roman Witula, Ramanujan Type Trigonometric Formulae, Demonstratio Math. 45 (2012) 779-796.
Index entries for linear recurrences with constant coefficients, signature (3,46,1).

Cf. A214683, A215112, A006053, A006054, A215076, A215100, A120757, A214699.

LinearRecurrence[{3, 46, 1}, {3, 3, 101}, 50]

Vec((3-6*x-46*x^2)/(1-3*x-46*x^2-x^3) + O(x^40)) \\ Michel Marcus, Apr 20 2016

a(n) = (c(1)^4/c(2))^n + (c(2)^4/c(4))^n + (c(4)^4/c(1))^n, where c(j) = 2*cos(2*Pi*j/7).

G.f.: (3-6*x-46*x^2)/(1-3*x-46*x^2-x^3).

More terms from Michel Marcus, Apr 20 2016

A215572 a(n) = 3a(n-1) + 46a(n-2) + a(n-3) with a(0)=2, a(1)=5, a(2)=106.

Original entry on oeis.org

2, 5, 106, 550, 6531, 44999, 435973, 3384404, 30252969, 246877464, 2135653370, 17793576423, 151867661753, 1276243154087, 10832435479322, 91356359187721, 773637352766062, 6534137016412674, 55281085635664595, 467187197014742851, 3951025667301212597, 33398969150217473532

Offset: 0

Roman Witula, Aug 16 2012

The Ramanujan-type sequence number 8 for the argument 2Pi/7 (see also A214683, A215112, A006053, A006054, A215076, A215100, A120757, A215560, A215569 for the numbers: 1, 1a, 2, 2a, 3-7 respectively). The sequence a(n) is one of the three special sequences (the remaining two are A215560 and A215569) connected with the following recurrence relation:
(c(1)^4/c(2))^(n/3) + (c(2)^4/c(4))^(n/3) + (c(4)^4/c(1))^(n/3) = at(n) + bt(n)*7^(1/3) + ct(n)*49^(1/3), where c(j):=2*cos(2*Pi*j/7), and the sequences at(n), bt(n), and ct(n) are defined in comments to A215560 (see also A215569). It follows that a(n)=ct(3*n+2), at(3*n+2)=bt(3*n+2)=0, which implies the first formula below.
We note that if a(n), a(n+1) and a(n+2) are all odd for some n in N then a(n+3) is even, a(n+4) is odd, a(n+5) and a(n+6) are both even, and the numbers a(n+7), a(n+8), a(n+9) are all odd again. In consequence, this situation hold for every n of the form 7*k+4, k=0,1,..., in the other words cyclical through all sequence a(n), n=4,5,... (from n=1 whenever we start from odd-even-even sequence).

			From 4*a(1)+5*a(2)=a(3) we obtain 4*((c(1)^4/c(2))^(5/3) + (c(2)^4/c(4))^(5/3) + (c(4)^4/c(1))^(5/3)) + 5*((c(1)^4/c(2))^(8/3) + (c(2)^4/c(4))^(8/3) + (c(4)^4/c(1))^(8/3)) = (4 + 5*c(1)^4/c(2))*((c(1)^4/c(2))^(5/3) + (4 + 5*c(2)^4/c(4))*((c(2)^4/c(4))^(5/3) + (4 + 5*c(4)^4/c(1))*((c(4)^4/c(1))^(5/3) = (c(1)^4/c(2))^(11/3) + (c(2)^4/c(4))^(11/3) + (c(4)^4/c(1))^(11/3) = 550*49^(1/3).

R. Witula, E. Hetmaniok, D. Slota, Sums of the powers of any order roots taken from the roots of a given polynomial, Proceedings of the Fifteenth International Conference on Fibonacci Numbers and Their Applications, Eger, Hungary, 2012.

G. C. Greubel, Table of n, a(n) for n = 0..1000
Roman Witula, Ramanujan Type Trigonometric Formulas: The General Form for the Argument 2*Pi/7, Journal of Integer Sequences, Vol. 12 (2009), Article 09.8.5.
Roman Witula, Full Description of Ramanujan Cubic Polynomials, Journal of Integer Sequences, Vol. 13 (2010), Article 10.5.7.
Roman Witula, Ramanujan Cubic Polynomials of the Second Kind, Journal of Integer Sequences, Vol. 13 (2010), Article 10.7.5.
Roman Witula, Ramanujan Type Trigonometric Formulae, Demonstratio Math. 45 (2012) 779-796.
Index entries for linear recurrences with constant coefficients, signature (3,46,1).

Cf. A214683, A215112, A006053, A006054, A215076, A215100, A120757, A215560, A215569.

LinearRecurrence[{3,46,1}, {2,5,106}, 50]
CoefficientList[Series[(2 - x - x^2)/(1 - 3*x - 46*x^2 - x^3), {x,0,50}], x] (* G. C. Greubel, Apr 16 2017 *)

Vec((2-x-x^2)/(1-3*x-46*x^2-x^3) + O(x^40)) \\ Michel Marcus, Apr 20 2016

49^(1/3)*a(n) = (c(1)^4/c(2))^(n+2/3) + (c(2)^4/c(4))^(n+2/3) + (c(4)^4/c(1))^(n+2/3) = (c(1)*(c(1)/c(2))^(1/3))^(3*n+2) + (c(2)*(c(2)/c(4))^(1/3))^(3*n+2) + (c(4)*(c(4)/c(1))^(1/3))^(3*n+2).

G.f.: (2-x-x^2)/(1-3*x-46*x^2-x^3).

More terms from Michel Marcus, Apr 20 2016

A116423 Binomial transform of A006053.

Original entry on oeis.org

0, 1, 3, 9, 26, 74, 209, 588, 1651, 4631, 12983, 36388, 101972, 285741, 800660, 2243445, 6286059, 17613241, 49351342, 138279586, 387451077, 1085614208, 3041824015, 8523002359, 23880923183, 66912861640, 187485674652, 525323190505, 1471922876424, 4124236259529

Offset: 1

Gary W. Adamson, Feb 14 2006

nonn

a(n)/a(n-1) tends to 2.801... = 1 + 2*cos(Pi/7).
A(n) := a(n+1)*(-1)^(n+1) appears in the following formula for the nonpositive powers of rho*sigma, where rho:=2*cos(Pi/7) and sigma:=sin(3*Pi/7)/sin(Pi/7) = rho^2-1 are the ratios of the smaller and larger diagonal length to the side length in a regular 7-gon (heptagon). See the Steinbach reference where the basis <1,rho,sigma> is used in an extension of the rational field. (rho*sigma)^(-n) = C(n) + B(n)*rho + A(n)*sigma, n >= 0, with C(n)= A085810(n)*(-1)^n, and B(n)= A181880(n-2)*(-1)^n. For the nonnegative powers see A120757(n), |A122600(n-1)| and A181879(n), respectively. See also a comment under A052547.
This sequence is constructible as a spiral tiling of similar trapezoids, as follows: start with an isosceles trapezoid with side lengths 3,1,4,1. Each new trapezoid is rotated and scaled so one leg fills all unoccupied space on the short base of the previous trapezoid. a(n) is given by the length of the n-th trapezoid's legs. This process is identical to the recursion relation added by R. J. Mathar in the Formula section. See the Links section for an illustration. - Andrew B. Hudson, Jun 19 2019

			a(5) = 26 = 1*0 + 1*4 + 4*1 + 4*3 + 6*1 = 4 + 4 + 12 + 6 = 26.

Jinyuan Wang, Table of n, a(n) for n = 1..1000
Andrew B. Hudson, Illustration of the first 7 terms as a spiral tiling of similar trapezoids.
Peter Steinbach, Golden Fields: A Case for the Heptagon, Mathematics Magazine, Vol. 70, No. 1, Feb. 1997.
Index entries for linear recurrences with constant coefficients, signature (4,-3,-1)

Cf. A006053.

I:=[0,1,3]; [n le 3 select I[n] else 4*Self(n-1)-3*Self(n-2)-Self(n-3): n in [1..30]]; // Vincenzo Librandi, Jul 11 2019

LinearRecurrence[{4, -3, -1}, {0, 1, 3}, 40] (* Vincenzo Librandi, Jul 11 2019 *)

concat(0, Vec(x^2*(1-x)/(1-4*x+3*x^2+x^3) + O(x^50))) \\ Michel Marcus, Sep 13 2014

Binomial transform of A006053 starting with A006053(1): (0, 1, 1, 3, 4, 9, 14, ...).
From R. J. Mathar, Apr 02 2008: (Start)
O.g.f.: x^2(1-x)/(1 - 4x + 3x^2 + x^3).
a(n) = 4*a(n-1) - 3*a(n-2) - a(n-3). (End)

More terms from R. J. Mathar, Apr 02 2008

More terms from Michel Marcus, Sep 13 2014

A181879 Expansion of x(1+x)/(1-3x-4*x^2-x^3).

Original entry on oeis.org

0, 1, 4, 16, 65, 263, 1065, 4312, 17459, 70690, 286218, 1158873, 4692181, 18998253, 76922356, 311452261, 1261044460, 5105864780, 20673224441, 83704176903, 338911293253, 1372223811812, 5556020785351, 22495868896554, 91083913642878, 368791237300201, 1493205235368669, 6045864568949689, 24479205885623944, 99114281168039257, 401305531615563236

Offset: 0

Wolfdieter Lang, Nov 26 2010

a(n) appears in the following formula for the nonnegative powers of rho*sigma, where rho:=2*cos(Pi/7) and sigma:=sin(3*Pi/7)/sin(Pi/7)= rho^2-1 are the ratios of the smaller and larger diagonal length to the side length in a regular 7-gon (heptagon). See the Steinbach reference where the basis <1,rho,sigma> is used in an extension of the rational field, called there Q(rho). (rho*sigma)^n = C(n) + B(n)*rho + a(n)*sigma,n>=0, with C(n)= A120757(n) with C(0):=1, and B(n)= |A122600(n-1)| with B(0)=1. For the nonpositive powers see A085810(n)*(-1)^n, A181880(n-2)*(-1)^n and A116423(n+1)*(-1)^(n+1), respectively. See also a comment under A052547.

P. Steinbach, Golden fields: a case for the heptagon, Math. Mag. 70 (1997), no. 1, 22-31.
Index entries for linear recurrences with constant coefficients, signature (3,4,1).

CoefficientList[Series[x (1+x)/(1-3x-4x^2-x^3),{x,0,40}],x] (* or *) LinearRecurrence[{3,4,1},{0,1,4},40] (* Harvey P. Dale, Feb 04 2024 *)

Vec((1+x)/(1-3*x-4*x^2-x^3)+O(x^99)) \\ Charles R Greathouse IV, Sep 24 2012

a(n) = 3*a(n-1) + 4*a(n-2) + a(n-3), n>=2, a(-1):=1, a(0)=0, a(1)=1.

A181880 Expansion of 1/(1-4x-3x^2-x^3).

Original entry on oeis.org

1, 4, 19, 89, 417, 1954, 9156, 42903, 201034, 942001, 4414009, 20683073, 96916320, 454128508, 2127946065, 9971086104, 46722311119, 218930448853, 1025859814873, 4806952917170, 22524321562152, 105544004814991, 494555936863590, 2317380083461485, 10858732149251701, 50881624784254849, 238420075668235984, 1117183909174960184, 5234877488488803537, 24529481757148330684

Offset: 0

Wolfdieter Lang, Nov 27 2010

B(n):=a(n-2)*(-1)^n, B(0):=0, B(1):=0, (o.g.f. x^2/(1 + 4*x + 3*x^2 -x^3))appears in the following formula for the nonpositive powers of rho*sigma, where rho:=2*cos(Pi/7) and sigma:=sin(3*Pi/7)/sin(Pi/7) = rho^2-1 are the ratios of the smaller and larger diagonal length to the side length in a regular 7-gon (heptagon). See the Steinbach reference where the basis <1,rho,sigma> is used in an extension of the rational field. (rho*sigma)^(-n) = C(n) + B(n)*rho + A(n)*sigma,n>=0, with C(n)= A085810(n)*(-1)^n, and A(n)= A116423(n+1)*(-1)^(n+1). For the nonnegative powers see A120757(n), |A122600(n-1)| and A181879(n), respectively. See also a comment under A052547.

P. Steinbach, Golden fields: a case for the heptagon, Math. Mag. 70 (1997), no. 1, 22-31.
Index entries for linear recurrences with constant coefficients, signature (4, 3, 1).

CoefficientList[Series[1/(1-4*x-3*x^2-x^3),{x,0,40}],x] (* or *) LinearRecurrence[{4,3,1},{1,4,19},40] (* Vladimir Joseph Stephan Orlovsky, Feb 01 2012 *)

O.g.f.: 1/(1-4*x-3*x^2-x^3).

a(n) = 4*a(n) + 3*a(n-2) +a(n-3), n>=2, a(-1):=0, a(0)=1, a(1)=4.

A215569 a(n) = 3a(n-1) + 46a(n-2) + a(n-3) with a(0)=0, a(1)=14, a(2)=49.

Original entry on oeis.org

0, 14, 49, 791, 4641, 50358, 365351, 3417162, 27107990, 238878773, 1967021021, 16916594611, 141471629572, 1204545261843, 10138247340452, 85965295695706, 725459810009753, 6140921279372187, 51879880394260905, 438847479843913070, 3709157858947113027

Offset: 0

Roman Witula, Aug 16 2012

The Ramanujan-type sequence number 7 for the argument 2Pi/7 (see also A214683, A215112, A006053, A006054, A215076, A215100, A120757, A215560 for the numbers: 1, 1a, 2, 2a, 3-6 respectively). The sequence a(n) is one of the three special sequences (the remaining two are A215560 and A215572) connected with the following recurrence relation:
(c(1)^4/c(2))^(n/3) + (c(2)^4/c(4))^(n/3) + (c(4)^4/c(1))^(n/3) = at(n) + bt(n)*7^(1/3) + ct(n)*49^(1/3), where c(j):=2*cos(2*Pi*j/7), and the sequences at(n), bt(n), and ct(n) satisfy the following system of recurrence equations: at(n)=7*bt(n-2)+at(n-3),
bt(n)=7*ct(n-2)+bt(n-3), ct(n)=at(n-2)+ct(n-3), with at(0)=3, at(1)=at(2)=bt(0)=bt(1)=bt(2)=ct(0)=ct(1)=0, ct(2)=2 - for details see the Witula's first paper (see also A215560). It follows that a(n)=bt(3*n+1), at(3*n+1)=ct(3*n+1)=0, which implies the first formula below.
We note that all numbers a(n) are divided by 7.

			We have  (c(1)^4/c(2))^(4/3) + (c(2)^4/c(4))^(4/3) + (c(4)^4/c(1))^(4/3) = (2/7)*(c(1)^4/c(2))^(7/3) + (c(2)^4/c(4))^(7/3) + (c(4)^4/c(1))^(7/3)).

R. Witula, E. Hetmaniok, D. Slota, Sums of the powers of any order roots taken from the roots of a given polynomial, Proceedings of the Fifteenth International Conference on Fibonacci Numbers and Their Applications, Eger, Hungary, 2012.

Roman Witula, Ramanujan Type Trigonometric Formulas: The General Form for the Argument 2*Pi/7, Journal of Integer Sequences, Vol. 12 (2009), Article 09.8.5.
Roman Witula, Full Description of Ramanujan Cubic Polynomials, Journal of Integer Sequences, Vol. 13 (2010), Article 10.5.7.
Roman Witula, Ramanujan Cubic Polynomials of the Second Kind, Journal of Integer Sequences, Vol. 13 (2010), Article 10.7.5.
Roman Witula, Ramanujan Type Trigonometric Formulae, Demonstratio Math. 45 (2012) 779-796.
Index entries for linear recurrences with constant coefficients, signature (3,46,1).

Cf. A214683, A215112, A006053, A006054, A215076, A215100, A120757, A215560.

LinearRecurrence[{3,46,1},{0,14,49},30] (* Harvey P. Dale, Jan 12 2015 *)

7^(1/3)*a(n) = (c(1)^4/c(2))^(n+1/3) + (c(2)^4/c(4))^(n+1/3) + (c(4)^4/c(1))^(n+1/3) = (c(1)*(c(1)/c(2))^(1/3))^(3*n+1) + (c(2)*(c(2)/c(4))^(1/3))^(3*n+1) + (c(4)*(c(4)/c(1))^(1/3))^(3*n+1).

G.f.: (14*x+7*x^2)/(1-3*x-46*x^2-x^3).

More terms from Harvey P. Dale, Jan 12 2015

cp's OEIS Frontend

A006053 a(n) = a(n-1) + 2*a(n-2) - a(n-3), with a(0) = a(1) = 0, a(2) = 1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

SageMath

Formula

Extensions

A085810 Number of three-choice paths along a corridor of height 5, starting from the lower side.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A122600 Expansion of 1/(1 + 3*x - 4*x^2 + x^3).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A215100 a(n) = 3*a(n-1) + 4*a(n-2) + a(n-3) with a(0)=2, a(1)=5, a(2)=22.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

SageMath

Formula

Extensions

A215560 a(n) = 3*a(n-1) + 46*a(n-2) + a(n-3) with a(0)=a(1)=3, a(2)=101.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A215572 a(n) = 3*a(n-1) + 46*a(n-2) + a(n-3) with a(0)=2, a(1)=5, a(2)=106.

Views

Author

Keywords

Comments

Examples

References

Links

A122600 Expansion of 1/(1 + 3x - 4x^2 + x^3).

A215100 a(n) = 3a(n-1) + 4a(n-2) + a(n-3) with a(0)=2, a(1)=5, a(2)=22.

A215560 a(n) = 3a(n-1) + 46a(n-2) + a(n-3) with a(0)=a(1)=3, a(2)=101.

A215572 a(n) = 3a(n-1) + 46a(n-2) + a(n-3) with a(0)=2, a(1)=5, a(2)=106.

A181879 Expansion of x(1+x)/(1-3x-4*x^2-x^3).

A181880 Expansion of 1/(1-4x-3x^2-x^3).

A215569 a(n) = 3a(n-1) + 46a(n-2) + a(n-3) with a(0)=0, a(1)=14, a(2)=49.