A038261
First line of 5-wave sequence A038201, also bisection of A006358.
Original entry on oeis.org
1, 5, 55, 671, 8272, 102091, 1260143, 15554592, 191998646, 2369942427, 29253473175, 361091343583, 4457144547354, 55016930950608, 679103551405906, 8382540166524150, 103470199055689961, 1277188284212361415
Offset: 0
-
a:= n-> (Matrix([[5, 1, 1, 2, 5]]). Matrix(5, (i,j)-> if i=j-1 then 1 elif j=1 then [15, -35, 28, -9, 1][i] else 0 fi)^n)[1,2]: seq(a(n), n=0..20); # Alois P. Heinz, Jul 16 2009
A038339
Bottom line of 5-wave sequence A038201, also bisection of A006358.
Original entry on oeis.org
1, 15, 190, 2353, 29056, 358671, 4427294, 54648506, 674555937, 8326406594, 102777312308, 1268635610806, 15659451261015, 193293024178230, 2385919696236315, 29450689289430149, 363525688224433321
Offset: 0
-
k=5; M(k)=matrix(k,k,i,j,min(i,j)); v(k)=vector(k,i,1); a(n)=vecmax(v(k)*M(k)^n)
A038340
Second line of 5-wave sequence A038201.
Original entry on oeis.org
1, 4, 9, 50, 105, 616, 1287, 7601, 15873, 93819, 195910, 1158052, 2418195, 14294449, 29849041, 176444054, 368442700, 2177943781, 4547886208, 26883530748, 56137003923, 331837870408, 692929213991, 4096053203771, 8553197751125
Offset: 0
- F. v. Lamoen, Wave sequences
- Index entries for linear recurrences with constant coefficients, signature (0,15,0,-35,0,28,0,-9,0,1).
-
a:= n-> (Matrix([`if`(irem(n,2)=0, [9, 1, 0, -1, -4], [4, 0, -1, -3, -9])]). Matrix(5, (i,j)-> if i=j-1 then 1 elif j=1 then [15, -35, 28, -9, 1][i] else 0 fi)^iquo(n+1, 2))[1,2]: seq(a(n), n=0..24); # Alois P. Heinz, Jul 16 2009
A038341
Fourth line of 5-wave sequence A038201.
Original entry on oeis.org
1, 2, 14, 29, 175, 365, 2163, 4516, 26703, 55759, 329615, 688286, 4068623, 8495917, 50221212, 104869718, 619907431, 1294463368, 7651850657, 15978257251, 94450905714, 197228218022, 1165858298498, 2434493909304, 14390815650209
Offset: 0
-
a:= n-> (Matrix([[`if`(irem(n,2)=0, 1, 2), 0, 0, 0, -1]]). Matrix(5, (i,j)-> if i=j-1 then 1 elif j=1 then [15, -35, 28, -9, 1][i] else 0 fi) ^iquo(n, 2))[1,1]: seq(a(n), n=0..30); # Alois P. Heinz, Jul 16 2009
A006358
Number of distributive lattices; also number of paths with n turns when light is reflected from 5 glass plates.
Original entry on oeis.org
1, 5, 15, 55, 190, 671, 2353, 8272, 29056, 102091, 358671, 1260143, 4427294, 15554592, 54648506, 191998646, 674555937, 2369942427, 8326406594, 29253473175, 102777312308, 361091343583, 1268635610806, 4457144547354
Offset: 0
- J. Berman and P. Koehler, Cardinalities of finite distributive lattices, Mitteilungen aus dem Mathematischen Seminar Giessen, 121 (1976), 103-124.
- S. J. Cyvin and I. Gutman, Kekulé structures in benzenoid hydrocarbons, Lecture Notes in Chemistry, No. 46, Springer, New York, 1988 (see p. 120).
- J. Haubrich, Multinacci Rijen [Multinacci sequences], Euclides (Netherlands), Vol. 74, Issue 4, 1998, pp. 131-133.
- D. E. Knuth, Art of Computer Programming, Vol. 3, Sect. 5.4.3, Column T1.
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
- T. D. Noe, Table of n, a(n) for n = 0..200
- J. Berman and P. Koehler, Cardinalities of finite distributive lattices, Mitteilungen aus dem Mathematischen Seminar Giessen, 121 (1976), 103-124. [Annotated scanned copy]
- Emma L. L. Gao, Sergey Kitaev, and Philip B. Zhang, Pattern-avoiding alternating words, arXiv:1505.04078 [math.CO], 2015.
- Manfred Goebel, Rewriting Techniques and Degree Bounds for Higher Order Symmetric Polynomials, Applicable Algebra in Engineering, Communication and Computing (AAECC), Volume 9, Issue 6 (1999), 559-573.
- G. Kreweras, Les préordres totaux compatibles avec un ordre partiel, Math. Sci. Humaines No. 53 (1976), 5-30.
- G. Kreweras, Les préordres totaux compatibles avec un ordre partiel, Math. Sci. Humaines No. 53 (1976), 5-30. (Annotated scanned copy)
- 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
- Index entries for linear recurrences with constant coefficients, signature (3,3,-4,-1,1).
-
A=seq(a.j,j=0..4):grammar1:=[Q4,{ seq(Q.i=Union(Epsilon,seq(Prod(a.j,Q.j),j=4-i..4)),i=0..4), seq(a.j=Z,j=0..4) }, unlabeled]: seq(count(grammar1,size=j),j=0..23); # Zerinvary Lajos, Mar 09 2007
A006358:=-(z-1)*(z**3-3*z-1)/(-1+3*z+3*z**2-4*z**3-z**4+z**5); # conjectured by Simon Plouffe in his 1992 dissertation
-
m = Table[ If[j <= 6-i, 1, 0], {i, 1, 5}, {j, 1, 5}] ; a[n_] := MatrixPower[m, n].Table[1, {5}]; Table[ a[n], {n, 0, 23}][[All, 1]] (* Jean-François Alcover, Dec 08 2011, after Benoit Cloitre *)
LinearRecurrence[{3,3,-4,-1,1},{1,5,15,55,190},30] (* Harvey P. Dale, Jun 16 2016 *)
-
k=5; M(k)=matrix(k,k,i,j,if(1-sign(i+j-k),0,1)); v(k)=vector(k,i,1); a(n)=vecmax(v(k)*M(k)^n)
-
{a(n)=local(p=5);polcoeff(sum(k=0,p-1,(-1)^((k+1)\2)*binomial((p+k-1)\2,k)* (-x)^k)/sum(k=0,p,(-1)^((k+1)\2)*binomial((p+k)\2,k)*x^k+x*O(x^n)),n)}
Alternative description and formula from Jacques Haubrich (jhaubrich(AT)freeler.nl)
A038196
3-wave sequence starting with 1, 1, 1.
Original entry on oeis.org
1, 1, 1, 2, 3, 5, 6, 11, 14, 25, 31, 56, 70, 126, 157, 283, 353, 636, 793, 1429, 1782, 3211, 4004, 7215, 8997, 16212, 20216, 36428, 45425, 81853, 102069, 183922, 229347, 413269, 515338, 928607, 1157954, 2086561, 2601899, 4688460, 5846414
Offset: 0
- J. Kappraff, Beyond Measure, World Scientific, Inc. 2002, p. 497.
-
a(n)=if(n>-1,polcoeff((1+x-x^2)/(1-2*x^2-x^4+x^6)+x*O(x^n),n),if(n<-3,polcoeff((1-x-x^2)/(1-x^2-2*x^4+x^6)+O(x^(-3-n)),-4-n),0))
A038197
4-wave sequence.
Original entry on oeis.org
1, 1, 1, 1, 2, 3, 4, 7, 9, 10, 19, 26, 30, 56, 75, 85, 160, 216, 246, 462, 622, 707, 1329, 1791, 2037, 3828, 5157, 5864, 11021, 14849, 16886, 31735, 42756, 48620, 91376, 123111, 139997, 263108, 354484, 403104, 757588, 1020696, 1160693, 2181389
Offset: 0
The first few rows of the T(n,k) array are, n>=1, 1 <= k <=4:
0, 0, 0, 1
1, 1, 1, 1
1, 2, 3, 4
4, 7, 9, 10
10, 19, 26, 30
30, 56, 75, 85
85, 160, 216, 246
- F. v. Lamoen, Wave sequences
- P. Steinbach, Golden fields: a case for the heptagon, Math. Mag. 70 (1997), no. 1, 22-31.
- Eric Weisstein's World of Mathematics, Nonagon.
- Index entries for linear recurrences with constant coefficients, signature (1,-1,3,-3,3,0,0,0,-1,1,-1).
Cf.
A120747 (m = 5: hendecagon or 11-gon)
-
m:=4: nmax:=15: 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
-
LinearRecurrence[{1,-1,3,-3,3,0,0,0,-1,1,-1},{1,1,1,1,2,3,4,7,9,10,19},50] (* Harvey P. Dale, Oct 02 2015 *)
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
- Jay Kappraff, Beyond Measure, A Guided Tour Through Nature, Myth and Number, World Scientific, 2002.
-
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 *)
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
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)
- G. C. Greubel, Table of n, a(n) for n = 1..1000
- Jay Kappraff, Slavik Jablan, Gary W. Adamson and Radmila Sazdanovich, Golden Fields, Generalized Fibonacci Sequences and Chaotic Matrices, Forma, Vol. 19 No. 4, pp. 367-387, 2004.
- P. Steinbach, Golden fields: a case for the heptagon, Math. Mag. 70 (1997), no. 1, 22-31, MR 1439165
- Eric Weisstein's World of Mathematics, Hendecagon.
- Index entries for linear recurrences with constant coefficients, signature (3,3,-4,-1,1).
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).
-
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
-
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
-
LinearRecurrence[{3, 3, -4, -1, 1}, {0, 1, 4, 14, 50}, 41] (* G. C. Greubel, Nov 13 2022 *)
-
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
Showing 1-9 of 9 results.
Comments