cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-6 of 6 results.

A038201 5-wave sequence.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 3, 4, 5, 9, 12, 14, 15, 29, 41, 50, 55, 105, 146, 175, 190, 365, 511, 616, 671, 1287, 1798, 2163, 2353, 4516, 6314, 7601, 8272, 15873, 22187, 26703, 29056, 55759, 77946, 93819, 102091, 195910, 273856, 329615, 358671, 688286, 962142
Offset: 0

Views

Author

Keywords

Comments

This sequence is related to the hendecagon or 11-gon, see A120747.
Sequence of perfect distributions for a cascade merge with six tapes according to Knuth. - Michael Somos, Feb 07 2004

Examples

			The first few rows of the T(n,k) array are, n>=1, 1 <= k <=5:
  0,   0,   0,   0,   1
  1,   1,   1,   1,   1
  1,   2,   3,   4,   5
  5,   9,   12,  14,  15
  15,  29,  41,  50,  55
  55,  105, 146, 175, 190
  190, 365, 511, 616, 671
G.f. = 1 + x + x^2 + x^3 + x^4 + 2*x^5 + 3*x^6 + 4*x^7 + 9*x^8 + 12*x^9 + ...
		

References

  • D. E. Knuth, Art of Computer Programming, Vol. 3, Sect. 5.4.3, Eq. (1).

Crossrefs

The a(4*n) values (column 0) lead to A006358; the T(n,k) lead to A069006, A038342 and A120747.

Programs

  • Maple
    m:=5: nmax:=12: for k from 1 to m-1 do T(1,k):=0 od: T(1,m):=1: for n from 2 to nmax do for k from 1 to m do T(n,k):= add(T(n-1,k1), k1=m-k+1..m) od: od: for n from 1 to nmax/2 do seq(T(n,k), k=1..m) od; a(0):=1: Tx:=1: for n from 2 to nmax do for k from 2 to m do a(Tx):= T(n,k): Tx:=Tx+1: od: od: seq(a(n), n=0..Tx-1); # Johannes W. Meijer, Aug 03 2011
  • Mathematica
    LinearRecurrence[{0,0,0,3,0,0,0,3,0,0,0,-4,0,0,0,-1,0,0,0,1},{1,1,1,1,1,2,3,4,5,9,12,14,15,29,41,50,55,105,146,175},50] (* Harvey P. Dale, Dec 13 2012 *)
  • PARI
    {a(n) = local(m); if( n<=0, n==0, m = (n-1)\4 * 4; sum(k=2*m - n, m, a(k)))};

Formula

a(n) = a(n-1)+a(n-2) if n=4*m+1, a(n) = a(n-1)+a(n-4) if n=4*m+2, a(n) = a(n-1)+a(n-6) if n=4*m+3 and a(n) = a(n-1)+a(n-8) if n=4*m.
G.f.: -(1+x+x^2+x^3-2*x^4-x^5+x^7-x^8-x^11+x^12)/(-1+3*x^4+3*x^8-4*x^12-x^16+x^20).
a(n) = 3*a(n-4)+3*a(n-8)-4*a(n-12)-a(n-16)+a(n-20).
a(n-1) = sequence(sequence(T(n,k), k=2..5), n>=2) with a(0)=1; T(n,k) = sum(T(n-1,k1), k1 = 6-k..5) with T(1,1) = T(1,2) = T(1,3) = T(1,4) = 0 and T(1,5) = 1; n>=1 and 1 <= k <= 5. [Steinbach]

Extensions

Edited by Floor van Lamoen, Feb 05 2002
Edited and information added by Johannes W. Meijer, Aug 03 2011

A038342 G.f.: 1/(1 - 3 x - 3 x^2 + 4 x^3 + x^4 - x^5).

Original entry on oeis.org

1, 3, 12, 41, 146, 511, 1798, 6314, 22187, 77946, 273856, 962142, 3380337, 11876254, 41725295, 146595013, 515037713, 1809501081, 6357387289, 22335644540, 78472648463, 275700866485, 968630080476, 3403123989780
Offset: 0

Views

Author

Keywords

Comments

Middle line of 5-wave sequence A038201.
Let M denotes the 5 X 5 matrix = row by row (1,1,1,1,1)(1,1,1,1,0)(1,1,1,0,0)(1,1,0,0,0)(1,0,0,0,0) and A(n) the vector (x(n),y(n),z(n),t(n),u(n))=M^n*A where A is the vector (1,1,1,1,1) then a(n)=z(n). - Benoit Cloitre, Apr 02 2002
a(n) appears in the formula for 1/rho(11)^n, with rho(11) := 2*cos(Pi/11) (length ratio (smallest diagonal/side) in the regular 11-gom) when written in the power basis of the degree 5 number field Q(rho(11)): 1/rho(11)^n = a(n)*1 + A230080(n)*rho(11) - A230081(n)*rho(11)^2 - A069006(n-1)* rho(11)^3 + a(n-1)*rho(11)^4, n >= 0, with A069006(-1) = 0 = a(-1). See A230080 with the example for n=4. - Wolfdieter Lang, Nov 04 2013
From Wolfdieter Lang, Nov 20 2013: (Start)
The limit a(n+1)/a(n) for n -> infinity is omega(11) := S(4, x) = 1 - 3*x^2 + x^4 with x = rho(11). omega(11) = 1/(2*cos(Pi*5/11)), approx. 3.51333709. For the Chebyshev S-polynomial see A049310. For rho(11) see the preceding comment. The decimal expansion of omega(11) is given in A231186. omega(11) is an integer in Q(rho(11)) with power basis coefficients [1,0,-3,0,1]. It is known to be the length ratio (longest diagonal)/side in the regular 11-gon.
This limit follows from the a(n)-recurrence and the solutions of X^5 - 3*X^4 - 3*X^3 + 4*X^2 + X - 1 = 0, which are given by the inverse of the known solutions of the minimal polynomial C(11, x) of rho(11) (see A187360). The other four X solutions are 1/rho(11), with coefficients [3,3,-4,-1,1] in the power basis of Q(rho(11)), approx. 0.52110856, 1/(2*cos(Pi*3/11)) with coefficients [-1,-1,1,0,0], approx. 0.763521119, 1/(2*cos(Pi*7/11)) with coefficients [0,-3,3,1,-1], approx. -1.20361562, and 1/(2*cos(Pi*9/11)) with coefficients [0,1,3,0,-1], approx. -0.59435114. These solutions for X are therefore irrelevant for this sequence.
The same limit omega(11) is therefore obtained for the sequences A069006, A230080 and A230081. See the Nov 04 2013 comment.
(End)

References

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

Crossrefs

Cf. A006358, A069006, A230080, A230081: same recurrence formula.
Cf. A066170.

Programs

  • Mathematica
    b = {-1, 3, 3, -4, -1, 1}; p[x_] := Sum[x^(n - 1)*b[[7 - n]], {n, 1, 6}] q[x_] := ExpandAll[x^5*p[1/x]] Table[ SeriesCoefficient[ Series[x/q[x], {x, 0, 30}], n], {n, 0, 30}] (* Roger L. Bagula and Gary W. Adamson, Sep 19 2006 *)
    LinearRecurrence[{3,3,-4,-1,1},{1,3,12,41,146},30] (* Harvey P. Dale, Aug 27 2012 *)

Formula

a(n) = 3a(n-1)+3a(n-2)-4a(n-3)-a(n-4)+a(n-5). Also a(n) = b(4n+2) with b(n) as in 5-wave sequence A038201.
G.f.: 1/(1 - 3 x - 3 x^2 + 4 x^3 + x^4 - x^5) = -1/C(11, x), with C(11, x) the minimal polynomial of 2*cos(Pi/11) (see the name and A187360 for C). - Wolfdieter Lang, Nov 07 2013

Extensions

More terms from Benoit Cloitre, Apr 02 2002
Edited by N. J. A. Sloane at the suggestion of Andrew S. Plewe, Jun 08 2007

A120747 Sequence relating to the 11-gon (or hendecagon).

Original entry on oeis.org

0, 1, 4, 14, 50, 175, 616, 2163, 7601, 26703, 93819, 329615, 1158052, 4068623, 14294449, 50221212, 176444054, 619907431, 2177943781, 7651850657, 26883530748, 94450905714, 331837870408, 1165858298498, 4096053203771, 14390815650209, 50559786403254
Offset: 1

Views

Author

Gary W. Adamson, Jul 01 2006

Keywords

Comments

The hendecagon is an 11-sided polygon. The preferred word in the OEIS is 11-gon.
The lengths of the diagonals of the regular 11-gon are r[k] = sin(k*Pi/11)/sin(Pi/11), 1 <= k <= 5, where r[1] = 1 is the length of the edge.
The value of limit(a(n)/a(n-1),n=infinity) equals the longest diagonal r[5].
The a(n) equal the matrix elements M^n[1,2], where M = Matrix([[1,1,1,1,1], [1,1,1,1,0], [1,1,1,0,0], [1,1,0,0,0], [1,0,0,0,0]]). The characteristic polynomial of M is (x^5 - 3x^4 - 3x^3 + 4x^2 + x - 1) with roots x1 = -r[4]/r[3], x2 = -r[2]/r[4], x3 = r[1]/r[2], x4 = r[3]/r[5] and x5 = r[5]/r[1].
Note that M^4*[1,0,0,0,0] = [55, 50, 41, 29, 15] which are all terms of the 5-wave sequence A038201. This is also the case for the terms of M^n*[1,0,0,0,0], n>=1.

Examples

			From _Johannes W. Meijer_, Aug 03 2011: (Start)
The lengths of the regular hendecagon edge and diagonals are:
  r[1] = 1.000000000, r[2] = 1.918985948, r[3] = 2.682507066,
  r[4] = 3.228707416, r[5] = 3.513337092.
The first few rows of the T(n,k) array are, n>=1, 1 <= k <=5:
    0,   0,   0,   0,   1, ...
    1,   1,   1,   1,   1, ...
    1,   2,   3,   4,   5, ...
    5,   9,  12,  14,  15, ...
   15,  29,  41,  50,  55, ...
   55, 105, 146, 175, 190, ...
  190, 365, 511, 616, 671, ... (End)
		

Crossrefs

From Johannes W. Meijer, Aug 03 2011: (Start)
Cf. A006358 (T(n+2,1) and T(n+1,5)), A069006 (T(n+1,2)), A038342 (T(n+1,3)), this sequence (T(n,4)) (m=5: hendecagon or 11-gon).
Cf. A000045 (m=2; pentagon or 5-gon); A006356, A006054 and A038196 (m=3: heptagon or 7-gon); A006357, A076264, A091024 and A038197 (m=4: enneagon or 9-gon); A006359, A069007, A069008, A069009, A070778 (m=6; tridecagon or 13-gon); A025030 (m=7: pentadecagon or 15-gon); A030112 (m=8: heptadecagon or 17-gon). (End)

Programs

  • Magma
    R:=PowerSeriesRing(Integers(), 40); [0] cat Coefficients(R!( x^2*(1+x-x^2)/(1-3*x-3*x^2+4*x^3+x^4-x^5) )); // G. C. Greubel, Nov 13 2022
    
  • Maple
    nmax:=27: m:=5: for k from 1 to m-1 do T(1,k):=0 od: T(1,m):=1: for n from 2 to nmax do for k from 1 to m do T(n,k):= add(T(n-1,k1), k1=m-k+1..m) od: od: for n from 1 to nmax/3 do seq(T(n,k), k=1..m) od; for n from 1 to nmax do a(n):=T(n,4) od: seq(a(n), n=1..nmax); # Johannes W. Meijer, Aug 03 2011
  • Mathematica
    LinearRecurrence[{3, 3, -4, -1, 1}, {0, 1, 4, 14, 50}, 41] (* G. C. Greubel, Nov 13 2022 *)
  • SageMath
    def A120747_list(prec):
        P. = PowerSeriesRing(ZZ, prec)
        return P( x*(1+x-x^2)/(1-3*x-3*x^2+4*x^3+x^4-x^5) ).list()
    A120747_list(40) # G. C. Greubel, Nov 13 2022

Formula

a(n) = 3*a(n-1) + 3*a(n-2) - 4*a(n-3) - a(n-4) + a(n-5).
G.f.: x^2*(1+x-x^2)/(1-3*x-3*x^2+4*x^3+x^4-x^5). - Maksym Voznyy (voznyy(AT)mail.ru), Aug 12 2009
From Johannes W. Meijer, Aug 03 2011: (Start)
a(n) = T(n,4) with T(n,k) = Sum_{k1 = 6-k..6} T(n-1, k1), T(1,1) = T(1,2) = T(1,3) = T(1,4) = 0 and T(1,5) = 1, n>=1 and 1 <= k <= 5. [Steinbach]
Sum_{k=1..5} T(n,k)*r[k] = r[5]^n, n>=1. [Steinbach]
r[k] = sin(k*Pi/11)/sin(Pi/11), 1 <= k <= 5. [Kappraff]
Sum_{k=1..5} T(n,k) = A006358(n-1).
Limit_{n -> 00} T(n,k)/T(n-1,k) = r[5], 1 <= k <= 5.
sequence(sequence( T(n,k), k=2..5), n>=1) = A038201(n-4).
G.f.: (x^2*(x - x1)*(x - x2))/((x - x3)*(x - x4)*(x - x5)*(x - x6)*(x - x7)) with x1 = phi, x2 = (1-phi), x3 = r[1] - r[3], x4 = r[3] - r[5], x5 = r[5] - r[4], x6 = r[4] - r[2], x7 = r[2], where phi = (1 + sqrt(5))/2 is the golden ratio A001622. (End)

Extensions

Edited and information added by Johannes W. Meijer, Aug 03 2011

A230080 Sequence needed for the nonpositive powers of rho(11) = 2*cos(Pi/11) in terms of the power basis of the degree 5 number field Q(rho(11)). Coefficients of the first power.

Original entry on oeis.org

0, 3, 5, 23, 73, 265, 920, 3245, 11385, 40018, 140574, 493911, 1735243, 6096533, 21419128, 75252674, 264387942, 928884046, 3263482673, 11465714843, 40282921096, 141527481021, 497233748352, 1746949771565, 6137623429414
Offset: 0

Views

Author

Wolfdieter Lang, Nov 04 2013

Keywords

Comments

The formula for the nonpositive powers of rho(11) := 2*cos(Pi/11) (the length ratio (smallest diagonal/side) in the regular 11-gon), when written in the power basis of the degree 5 algebraic number field Q(rho(11)) is: 1/rho(11)^n = A038342(n)*1 + a(n)*rho(11) - A230081(n)*rho(11)^2 - A069006(n-1)*rho(11)^3 + A038342(n-1)*rho(11)^4, n >= 0, with A069006(-1) = 0 = A038342(-1).

Examples

			1/rho(11)^4 = 146*1 + 73*rho(11) - 173*rho(11)^2 - 29*rho(11)^3  + 41*rho(11)^4 (approximately 0.07374164519).
		

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{3,3,-4,-1,1},{0,3,5,23,73},30] (* Harvey P. Dale, May 19 2017 *)

Formula

G.f.: x*(3 - 4*x - x^2 + x^3)/(1 - 3*x - 3*x^2 + 4*x^3 + x^4 - x^5).
a(n) = 3*a(n-1) +3*a(n-2) -4*a(n-3) -a(n-4) +a(n-5) for n >= 0, with a(-5)=-3, a(-4)=a(-3)=a(-2)=0, a(-1)=1.

A230081 Sequence needed for the nonpositive powers of rho(11) = 2*cos(Pi/11) in the power basis of the degree 5 number field Q(rho(11)). Negative of the coefficients of the second power.

Original entry on oeis.org

0, 4, 13, 50, 173, 613, 2149, 7557, 26543, 93264, 327657, 1151183, 4044478, 14209634, 49923211, 175397097, 616229093, 2165020570, 7606447024, 26724012524, 93890464368, 329868851103, 1158940469863, 4071748539926, 14305425173111
Offset: 0

Views

Author

Wolfdieter Lang, Nov 04 2013

Keywords

Comments

The formula for the nonpositive powers of rho(11) := 2*cos(Pi/11) (the length ratio (smallest diagonal/side) in the regular 11-gon), when written in the power basis of the degree 5 algebraic number field Q(rho(11)) is: 1/rho(11)^n = A038342(n)*1 + A230080*rho(11) - a(n)*rho(11)^2 - A069006(n-1)*rho(11)^3 + A038342(n-1)*rho(11)^4, n >= 0, with A069006(-1) = 0 = A038342(-1).

Examples

			1/rho(11)^4 = 146*1 + 73*rho(11) - 173*rho(11)^2 - 29*rho(11)^3  + 41*rho(11)^4 (approximately 0.07374164519).
		

Crossrefs

Formula

G.f.: x*(4 + x - x^2) / (1 - 3*x - 3*x^2 + 4*x^3 + x^4 - x^5).
a(n) = 3*a(n-1) +3*a(n-2) -4*a(n-3) -a(n-4) +a(n-5) for n >= 0, with a(-5)=3, a(-4)=0, a(-3)=0, a(-2)=-1, a(-1)=0.

A231186 Decimal expansion of the ratio (longest diagonal)/side in a regular 11-gon (or hendecagon).

Original entry on oeis.org

3, 5, 1, 3, 3, 3, 7, 0, 9, 1, 6, 6, 6, 1, 3, 5, 1, 8, 8, 7, 8, 2, 1, 7, 1, 5, 9, 6, 2, 9, 7, 9, 8, 1, 8, 4, 2, 0, 7, 4, 5, 9, 4, 8, 1, 7, 7, 7, 0, 1, 4, 9, 4, 2, 2, 1, 3, 7, 7, 4, 6, 9, 0, 0, 1, 2, 0, 1, 8, 1, 7, 7, 5, 6, 9, 3, 0, 3, 0, 5, 2, 5, 9, 2, 8, 9, 1, 5, 3, 2, 9, 1, 7, 1, 4, 9, 9, 3, 7, 0, 0, 1, 6
Offset: 1

Views

Author

Wolfdieter Lang, Nov 20 2013

Keywords

Comments

omega(11):= S(4, x) = 1 - 3*x^2 + x^4 with x = rho(11) := 2*cos(Pi/11). See A049310 for Chebyshev s-polynomials. rho(11) is the ratio (shortest diagonal)/side in a regular 11-gon. See the Q(2*cos(Pi/n)) link given in A187360. This is the power basis representation of omega(11) in the algebraic number field Q(2*cos(Pi/11)) of degree 5.
omega(11) = 1/(2*cos(Pi*5/11)) = 1/R(5, rho(11)) with the R-polynomial given in A127672. This follows from a computation of the power basis coefficients of the reciprocal of R(5, x) (mod C(11, x)) = 1+2*x-3*x^2-x^3+x^4, where C(11, x) is the minimal polynomial of rho(11) given in A187360. The result for this reciprocal (mod C(11, x)) is 1 - 3*x^2 + x^4 giving the power base coefficients [1,0,-3,0,1] for omega(11).
omega(11) is the analog in the regular 11-gon of the golden section in the regular 5-gon (pentagon), because it is the limit of a(n+1)/a(n) for n -> infinity of sequences like A038342, A069006, A230080 and A230081.
The ratio diagonal/side of the second and third shortest diagonals in a regular 11-gon are respectively x^2 - 1 and x^3 - 2*x, where x = 2*cos(Pi/11). - Mohammed Yaseen, Nov 03 2020

Examples

			3.51333709166613518878217159629798184207459481777014...
		

Crossrefs

Programs

  • Mathematica
    RealDigits[Sin[5*Pi/11]/Sin[Pi/11], 10, 120][[1]] (* Amiram Eldar, Jun 01 2023 *)

Formula

omega(11) = 1 - 3*x^2 + x^4 with x = rho(11) := 2*cos(Pi/11) = 1/(2*cos(Pi*5/11)) = 3.5133370916661... See the comments above.
Equals sin(5*Pi/11)/sin(Pi/11). - Mohammed Yaseen, Nov 03 2020
Showing 1-6 of 6 results.