A006357 -id:A006357 - cp's OEIS frontend

A006356 a(n) = 2*a(n-1) + a(n-2) - a(n-3) for n >= 3, starting with a(0) = 1, a(1) = 3, and a(2) = 6.

1, 3, 6, 14, 31, 70, 157, 353, 793, 1782, 4004, 8997, 20216, 45425, 102069, 229347, 515338, 1157954, 2601899, 5846414, 13136773, 29518061, 66326481, 149034250, 334876920, 752461609, 1690765888, 3799116465, 8536537209, 19181424995

Offset: 0

N. J. A. Sloane

Number of distributive lattices; also number of paths with n turns when light is reflected from 3 glass plates.
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, ... (this sequence 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 = A077998 with an extra initial 0. - Benoit Cloitre, Apr 05 2002
Also u(k)^2 + v(k)^2 + w(k)^2 = u(2*k). - Gary W. Adamson, Dec 23 2003
The n-th term of the series is the number of paths for a ray of light that enters two layers of glass and then is reflected exactly n times before leaving the layers of glass.
One such path (with 2 plates of glass and 3 reflections) might be:
...\........./..................
--------------------------------
....\/\..../....................
--------------------------------
........\/......................
--------------------------------
For a k-glass sequence, say a(n,k), a(n,k) is always asymptotic to z(k)*w(k)^n where w(k) = (1/2)/cos(k*Pi/(2*k+1)) and it is conjectured that z(k) is the root 1 < x < 2 of a polynomial of degree Phi(2k+1)/2.
Number of ternary sequences of length n-1 such that every pair of consecutive digits has a sum less than 3. That is to say, the pairs (1,2), (2,1) and (2,2) do not appear. - George J. Schaeffer (gschaeff(AT)andrew.cmu.edu), Sep 07 2004
Number of weakly up-down sequences of length n using the digits {1,2,3}. When n=2 the sequences are 11, 12, 13, 22, 23, 33.
Form the graph with matrix A = [1, 1, 1; 1, 0, 0; 1, 0, 1]. Then A006356 counts walks of length n that start at the degree 4 vertex. - Paul Barry, Oct 02 2004
In general, the g.f. for p glass plates is: A(x) = F_{p-1}(-x)/F_p(x) where F_p(x) = Sum_{k=0..p} (-1)^[(k+1)/2]*C([(p+k)/2],k)*x^k. - Paul D. Hanna, Feb 06 2006
Equals the INVERT transform of (1, 2, 1, 1, 1, ...) equivalent to a(n) = a(n-1) + 2*a(n-2) + a(n-3) + a(n-4) + ... + 1. a(6) = 70 = (31 + 2*14 + 6 + 3 + 1 + 1). - Gary W. Adamson, Apr 27 2009
a(n) = the number of terms in the n-th iterate of sequence A179542 generated from the rules a(0) = 1, then (1->1,2,3), (2->1,2), (3->1).
Example: 3rd iterate = (1,2,3,1,2,1,1,2,3,1,2,1,2,3) = 14 terms composed of a frequency of (6, 5, 3): (1's, 2's, and 3's), where a(3) = 14, and the [6, 5, 3] = top row and left column of the 3rd power of M, the matrix generator [1,1,1; 1,1,0; 1,0,0] or a(2) = 6, A006054(4) = 5, and a(1) = 3.
Given the heptagon diagonal lengths with edge = 1: (a = 1, b = 1.80193773..., c = 2.24697...) = (1, 2*cos(Pi/7), (1 + 2*cos(2*Pi/7))), and using the diagonal product formulas in [Steinbach], we obtain: c^n = c*a(n-2) + b*A006054(n) + a(n-3) corresponding to the top row of M^(n-1), in the case M^3 = [6, 5, 3]. Example: c^4 = 25.491566... = 6*c + 5*b + 3 = 13.481... + 9.00968... + 3. - Gary W. Adamson, Jul 18 2010
Equals row sums of triangle A180262. - Gary W. Adamson, Aug 21 2010
The number of the one-sided n-step prudent walks, avoiding 2 or more consecutive east steps. - Shanzhen Gao, Apr 27 2011
a(n) = [A_{7,2}^(n+2)](1,1), where A{7,2} is the 3 X 3 unit-primitive matrix (see [Jeffery]) A_{7,2} = [0,0,1; 0,1,1; 1,1,1]. The denominator of the generating function for this sequence is also the characteristic polynomial of A_{7,2}. - L. Edson Jeffery, Dec 06 2011 [See the comments for sequence A306334. - Petros Hadjicostas, Nov 17 2019]
a(n) is the top left entry of the n-th power of the 3 X 3 matrix [1, 1, 1; 1, 0, 0; 1, 0, 1] or of the 3 X 3 matrix [1, 1, 1; 1, 1, 0; 1, 0, 0]. - R. J. Mathar, Feb 03 2014
Successive sequences in this set (A006356, A006357, A006358, etc.) can be generated as follows: Begin with (1, 1, 1, 1, 1, 1, ...); and perform an operation with three steps to get the next sequence in the series. First, put alternate signs in the current series: With (1, 1, 1, ...) this equals (1, -1, 1, -1, ...); then take the inverse, getting (1, 1, 0, 0, 0, ...). Take the INVERT transform of the last step, getting (1, 2, 3, 5, 8, ...). Repeat the three steps using (1, 2, 3, 5, ...) --> (1, -2, 3, -5) --> (1, 2, 1, 1, 1, ...) --> (1, 3, 6, 14, 31, ...). Repeat the three steps using (1, 3, 6, 14, 31, ...), getting (1, 4, 10, 30, 85, ...) = A006357; and so on. - Gary W. Adamson, Aug 08 2019
Let W_n be the fence poset (a.k.a. zig-zag poset) of size n.  Let [2] be a chain of size 2.  Then a(n) is the number of antichains in the product poset W_n X [2]. See Berman- Koehler link. - Geoffrey Critzer, Jun 13 2023
a(n) is the number of double-dimer covers of the 2 X (n+1) square grid graph. See Musiker et al. link. - Nicholas Ovenhouse, Jan 07 2024
In general, the number of weakly up-down words of length n over an alphabet of size k is given by 4/(2*k+1)*|Sum_{j = 1..k} sin^2(2*j*Pi/(2*k+1))/(2*cos^2(2*j*Pi/(2*k+1)))^(n+1)| and the corresponding g. f. is given by V_(k-1)(-x/2)/W_k(x/2) if k is even and -W_(k-1)(-x/2) / V_k(x/2) if k is odd, where V_m(x) and W_m(x) are the Chebyshev polynomials of the third and fourth kind, respectively (see Paul D. Hanna's comment above and the Fried link). - Sela Fried, Apr 01 2025

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).
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 2nd edition, p. 291 (very briefly without generalizations).
J. Haubrich, Multinacci Rijen [Multinacci sequences], Euclides (Netherlands), Vol. 74, Issue 4, 1998, pp. 131-133.
Jay Kappraff, Beyond Measure, A Guided Tour Through Nature, Myth and Number, World Scientific, 2002.
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]
J. Berman and P. Köhler, On Dedekind Numbers and Two Sequences of Knuth, J. Int. Seq., Vol. 24 (2021), Article 21.10.7.
Sela Fried, A formula for the number of up-down words, arXiv:2503.02005 [math.CO], 2025.
Emma L. L. Gao, Sergey Kitaev, and Philip B. Zhang, Pattern-avoiding alternating words, arXiv:1505.04078 [math.CO], 2015.
Shanzhen Gao and Keh-Hsun Chen, Tackling Sequences From Prudent Self-Avoiding Walks, FCS'14, The 2014 International Conference on Foundations of Computer Science.
S. Gao and H. Niederhausen, Sequences Arising From Prudent Self-Avoiding Walks, 2010.
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.
V. E. Hoggatt Jr. and M. Bicknell-Johnson, Reflections across two and three glass plates, Fibonacci Quarterly, volume 17 (1979), 118-142.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 451
L. E. Jeffery, Unit-primitive matrices
B. Junge and V. E. Hoggatt, Jr., Polynomials arising from reflections across multiple plates, Fib. Quart., 11 (1973), 285-291.
Peter Köhler, The Central Decomposition of FD_01(n), Order (2021).
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)
Julien Leroy, Michel Rigo, and Manon Stipulanti, Behavior of Digital Sequences Through Exotic Numeration Systems, Electronic Journal of Combinatorics 24(1) (2017), #P1.44.
Leo Moser, Problem B-6: some reflections, Fib. Quart. Vol. 1, No. 4 (1963), 75-76.
Leo Moser and Max Wyman, Multiple reflections, Fib. Quart., 11 (1973).
Gregg Musiker, Ralf Schiffler, Nicholas Ovenhouse, and Sylvester Zhang, Higher Dimer Covers on Snake Graphs, arXiv:2306.14389 [math.CO], 2023.
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.
Lingjuan Shi and Kai Deng, The Numbers of Perfect and Maximal Matchings in Double Hexagonal Chains, Match Comm. Math. Comp. Chem. (2025) 659-685. See p. 8.
P. Steinbach, Golden fields: a case for the heptagon, Math. Mag. 70 (1997), no. 1, 22-31.
R. Witula, D. Slota and A. 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 (2,1,-1).

Cf. A000217, A000330, A050446, A050447, A006054, A077998, A052534, A052994, A052949.
See also A006357-A006359, A025030, A030112-A030116.
Cf. A038196 (3-wave sequence).
Cf. A179542. - Gary W. Adamson, Jul 18 2010
Cf. A180262. - Gary W. Adamson, Aug 21 2010
Cf. A033303, A190360, A306334.

a006056 n = a006056_list !! n
a006056_list = 1 : 3 : 6 : zipWith (+) (map (2 *) $ drop 2 a006056_list)
   (zipWith (-) (tail a006056_list) a006056_list)
-- Reinhard Zumkeller, Oct 14 2011

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

A006356:=-(-1-z+z**2)/(1-2*z-z**2+z**3); # conjectured by Simon Plouffe in his 1992 dissertation

LinearRecurrence[{2,1,-1},{1,3,6},30] (* or *) CoefficientList[ Series[ (1+x-x^2)/(1-2x-x^2+x^3),{x,0,30}],x] (* Harvey P. Dale, Jul 06 2011 *)
Table[If[n==0, a2=0; a1=1; a0=1, a3=a2; a2=a1; a1=a0; a0=2*a1+a2-a3], {n, 0, 29}] (* Jean-François Alcover, Apr 30 2013 *)

a(n):=sum(sum((sum(binomial(j,-3*k+2*j+i)*(-1)^(j-k)*binomial(k,j),j,0,k))*binomial(n+k-i-1,k-1),i,k,n),k,1,n); /* Vladimir Kruchinin, May 05 2011 */

{a(n)=local(p=3);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)} \\ Paul D. Hanna, Feb 06 2006

Vec((1+x-x^2)/(1-2*x-x^2+x^3)+O(x^66)) \\ Joerg Arndt, Apr 30 2013

from math import comb
def A006356(n): return sum(comb(j,a)*comb(k,j)*comb(n+k-i,k-1)*(-1 if j-k&1 else 1) for k in range(1,n+2) for i in range(k,n+2) for j in range(k+1) if (a:=-3*k+2*j+i)>=0) # Chai Wah Wu, Feb 19 2024

a(n) is asymptotic to z(3)*w(3)^n where w(3) = (1/2)/cos(3*Pi/7) and z(3) is the root 1 < X < 2 of P(3, X) = 1 - 14*X - 49*X^2 + 49*X^3. w(3) = 2.2469796.... z(3) = 1.220410935...
G.f.: (1 + x - x^2)/(1 - 2*x - x^2 + x^3). - Paul D. Hanna, Feb 06 2006
a(n) = a(n-1) + a(n-2) + A006054(n+1). - Gary W. Adamson, Jun 05 2008
a(n) = A006054(n+2) + A006054(n+1) - A006054(n). - R. J. Mathar, Apr 07 2011
a(n-1) = Sum_{k = 1..n} Sum_{i = k..n} Sum_{j = 0..k} binomial(j, -3*k+2*j+i) * (-1)^(j-k) * binomial(k, j) * binomial(n+k-i-1, k-1). - Vladimir Kruchinin, May 05 2011
Sum_{k=0..n} a(k) = a(n+1) - a(n-1) - 1. - Greg Dresden and Mina BH Arsanious, Aug 23 2023

Recurrence, alternative description from Jacques Haubrich (jhaubrich(AT)freeler.nl)

Alternative definition added by Andrew Niedermaier, Nov 11 2008

A050446 Table read by ascending antidiagonals: T(n, m) giving total degree of n-th-order elementary symmetric polynomials in m variables.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 5, 6, 4, 1, 1, 8, 14, 10, 5, 1, 1, 13, 31, 30, 15, 6, 1, 1, 21, 70, 85, 55, 21, 7, 1, 1, 34, 157, 246, 190, 91, 28, 8, 1, 1, 55, 353, 707, 671, 371, 140, 36, 9, 1, 1, 89, 793, 2037, 2353, 1547, 658, 204, 45, 10, 1, 1, 144, 1782, 5864, 8272, 6405, 3164, 1086, 285, 55, 11, 1

Offset: 0

N. J. A. Sloane, Dec 23 1999

T(n, m) is a polynomial of degree n in m. For example, T(2, m) = (m + 1)(m + 2)/2. For the polynomials corresponding to n = 1, 2, ..., 10, see the Cyvin-Gutman reference (p. 143). Kekulé numbers for certain benzenoids. - Emeric Deutsch, Jun 12 2005
Let LOOP X C_k, k >= 1, be the graph constructed by attaching a loop to each vertex of the cycle graph C_k. Let G_n, n >= 0, be the graph obtained by deleting one edge from LOOP X C_{n+1} while retaining the n + 1 loops; e.g., for n = 4, see the graph G_4 at the top of the page in the Stanley link below. Then T(n, m) equals the number of magic labelings of G_n having magic sum m. (See the second Mathematica program below which requires the "Omega" package authored by Axel Riese and which can be downloaded from the link provided in the article by Andrews et al.) - L. Edson Jeffery, Oct 19 2017
For n != 1, T(n, m) is the number of up-down words of length n over an alphabet of size m. - Sela Fried, Apr 08 2025
Conjecture: T(n,m) is the number of words of length n over the alphabet [m] such that any pair of adjacent letters sum to at most m + 1. - John Tyler Rascoe, Jun 06 2025

			Array begins:
  [0]  1  1    1     1      1      1       1       1        1        1
  [1]  1  2    3     4      5      6       7       8        9       10
  [2]  1  3    6    10     15     21      28      36       45       55
  [3]  1  5   14    30     55     91     140     204      285      385
  [4]  1  8   31    85    190    371     658    1086     1695     2530
  [5]  1 13   70   246    671   1547    3164    5916    10317    17017
  [6]  1 21  157   707   2353   6405   15106   31998    62349   113641
  [7]  1 34  353  2037   8272  26585   72302  173502   377739   760804
  [8]  1 55  793  5864  29056 110254  345775  940005  2286648  5089282
  [9]  1 89 1782 16886 102091 457379 1654092 5094220 13846117 34053437
  ...
Triangle starts:
  [0] 1;
  [1] 1,  1;
  [2] 1,  2,  1;
  [3] 1,  3,  3,  1;
  [4] 1,  5,  6,  4,  1;
  [5] 1,  8, 14, 10,  5, 1;
  [6] 1, 13, 31, 30, 15, 6, 1;

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 (pp. 142-144).

G. E. Andrews, P. Paule and A. Riese, MacMahon's partition analysis III. The Omega package.
J. Berman and P. Koehler, Cardinalities of finite distributive lattices, Mitteilungen aus dem Mathematischen Seminar Giessen, 121 (1976), 103-124. [Annotated scanned copy]
Byeong-Gil Choe and Hyeong-Kwan Ju, A Recurrence Relation Associated with Unit-Primitive Matrices, arXiv:2305.03930 [math.CO], 2023.
L. Carlitz and R. Scoville, Up-down sequences, Duke Math. J. (39) (1972), 583-598.
Jane Ivy Coons and Seth Sullivant, The h*-polynomial of the order polytope of the zig-zag poset, arXiv:1901.07443 [math.CO], 2019.
Sela Fried, A formula for the number of up-down words, arXiv:2503.02005 [math.CO], 2025.
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.
Hyeong-Kwan Ju, On the sequence generated by a certain type of matrices, Honam Math. J. 39, No. 4, 665-675 (2017).
Daeseok Lee and H.-K. Ju, An Extension of Hibi's palindromic theorem, arXiv preprint arXiv:1503.05658 [math.CO], 2015.
T. Kyle Petersen and Yan Zhuang, Zig-zag Eulerian polynomials, arXiv:2403.07181 [math.CO], 2024.
R. P. Stanley, Examples of Magic Labelings, Unpublished Notes, 1973. [Cached copy, with permission] See p. 31.
Guoce Xin and Yueming Zhong, Proving some conjectures on Kekulé numbers for certain benzenoids by using Chebyshev polynomials, arXiv:2201.02376 [math.CO], 2022.

Rows give A000012, A000027, A000217, A000330, A006322, ...
Columns give A000012, A000045, A000045, A006356, A006357, A006358, ...
Cf. A050447.

A050446 := proc(n,m)
    option remember;
    if m=0 then
        1;
    else
        procname(n,m-1)+add( procname(2*k,m-1) *procname(n-1-2*k,m), k=0..floor((n-1)/2) );
    end if;
end proc:
for d from 0 to 12 do
    for m from 0 to d do
        printf("%d,",A050446(d-m,m)) ;
    end do:
end do: # R. J. Mathar, Dec 14 2011
A050446 := := (n, m) -> evalf(abs(add(tan(2*j*Pi/(2*m + 1))^2*sec(2*j*Pi/(2*m + 1))^(n - 1), j = 1 .. m))/(2^(n - 1)*(2*m + 1))): # Sela Fried, Apr 28 2025

t[n_, m_?Positive] := t[n, m] = t[n, m-1] + Sum[t[2k, m-1]*t[n-1 - 2k, m], {k, 0, (n-1)/2}]; t[n_, 0] = 1; Flatten[Table[t[i-k , k-1], {i, 1, 12}, {k, 1, i}]] (* Jean-François Alcover, Jul 25 2011, after formula *)
<< Omega.m; nmax = 9; Do[cond[n_] = {}; If[n == 0, cond[n] = {a[1] == a[2]}, AppendTo[cond[n], {a[1] + a[2] == a[2 n + 2], a[2 n] + a[2 n + 1] == a[2 n + 2]}]; If[n > 1, Do[AppendTo[cond[n], a[2 j] + a[2 j + 1] + a[2 j + 2] == a[2 n + 2]], {j, n - 1}]]]; cond[n] = Flatten[cond[n]]; f[n_] = OEqSum[Product[x[i]^a[i], {i, 2 n + 2}], cond[n], u][[1]] /. x[2 n + 2] -> y /. x[] -> 1; Do[f[n] = OEqR[f[n], Subscript[u, j]], {j, Length[cond[n]]}], {n, 0, nmax}]; Grid[Table[CoefficientList[Series[f[n], {y, 0, nmax}], y], {n, 0, nmax}]] (* _L. Edson Jeffery, Oct 19 2017 *)

from functools import cache
@cache
def T(n, k):
    return T(n, k - 1) + sum(T(2 * j, k - 1) * T(n - 1 - 2 * j, k)
        for j in range(1 + (n - 1) // 2)) if k > 0 else 1
for n in range(6): print([T(n - k, k) for k in range(n + 1)])
# Peter Luschny, Jun 08 2024

T(n, m) = T(n, m - 1) + Sum_{k=0..(n-1)/2} T(2*k, m - 1)*T(n - 1 - 2*k, m).
From Sela Fried, Apr 08 2025: (Start)
T(n, m) = 1/(2^(n-1)*(2*m+1))*|Sum_{j = 1..m} tan^2(2*j*Pi/(2*m+1))*sec^(n+1)(2*j*Pi/(2*m+1)))|.
G.f. for words of odd length over an alphabet of size m: x*U_{m-1}(1-x^2/2)/V_{m-1}(1-x^2/2),
g.f. for words of even length over an alphabet of size m: 1/V_{m-1}(1-x^2/2),
where U_k(x) and V_k(x) are the Chebyshev polynomials of the second and third kind, respectively. (End)

More terms from Naohiro Nomoto, Jul 03 2001

A050447 Table T(n,m) giving total degree of n-th-order elementary symmetric polynomials in m variables, -1 <= n, 1 <= m, transposed and read by upward antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 6, 5, 1, 1, 5, 10, 14, 8, 1, 1, 6, 15, 30, 31, 13, 1, 1, 7, 21, 55, 85, 70, 21, 1, 1, 8, 28, 91, 190, 246, 157, 34, 1, 1, 9, 36, 140, 371, 671, 707, 353, 55, 1, 1, 10, 45, 204, 658, 1547, 2353, 2037, 793, 89, 1, 1, 11, 55, 285, 1086, 3164, 6405, 8272, 5864, 1782, 144, 1

Offset: 0

N. J. A. Sloane, Dec 23 1999

			Table begins
.    1   1   1    1     1      1       1       1        1         1
.    1   2   3    5     8     13      21      34       55        89
.    1   3   6   14    31     70     157     353      793      1782
.    1   4  10   30    85    246     707    2037     5864     16886
.    1   5  15   55   190    671    2353    8272    29056    102091
.    1   6  21   91   371   1547    6405   26585   110254    457379
.    1   7  28  140   658   3164   15106   72302   345775   1654092
.    1   8  36  204  1086   5916   31998  173502   940005   5094220
.    1   9  45  285  1695  10317   62349  377739  2286648  13846117
.    1  10  55  385  2530  17017  113641  760804  5089282  34053437

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).
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.

T. D. Noe, Table of 100 antidiagonals
J. Berman and P. Koehler, Cardinalities of finite distributive lattices, Mitteilungen aus dem Mathematischen Seminar Giessen, 121 (1976), 103-124. [Annotated scanned copy]
G. Kreweras, Les préordres totaux compatibles avec un ordre partiel, Math. Sci. Humaines No. 53 (1976), 5-30.
R. P. Stanley, Examples of Magic Labelings, Unpublished Notes, 1973. [Cached copy, with permission] See p. 31.

Rows give A000012, A000045, A006356, A006357, A006358, ...
Columns give A000012, A000027, A000217, A000330, A006322, ...
Cf. A001924, A050446.

nmax = 12; t[n_, m_?Positive] := t[n, m] = t[n, m-1] + Sum[t[2k, m-1]*t[n-1-2k, m], {k, 0, (n-1)/2}]; t[n_, 0]=1; Flatten[ Table[ t[k-1, n-k], {n, 1, nmax}, {k, 1, n}]] (* Jean-François Alcover, Nov 14 2011 *)
nmax = 10; f[0, x_] := 1; f[1, x_] := 1/(1 - x); f[n_, x_] := (x + f[n - 2, x])/(1 - x^2 - x*f[n - 2, x]); t[n_, m_] := Coefficient[Series[f[n, x], {x, 0, m}], x, m]; Grid[Table[t[n, m], {n, nmax}, {m, 0, nmax - 1}]] (* L. Edson Jeffery, Oct 19 2017 *)

M(n)=matrix(n,n,i,j,if(sign(i+j-n)-1,0,1)); V(n)=vector(n,i,1); P(r,n)=vecmax(V(r)*M(r)^n) \\ P(r,n) is T(n,k); Benoit Cloitre, Jan 27 2003

See PARI code. See A050446 for recurrence.

G.f. for row n >= 0: f(n, x) = (x + f(n-2, x))/(1 - x^2 - x*f(n-2, x)), where f(0, x) = 1 and f(1, x) = 1/(1 - x) [R. P. Stanley]. - L. Edson Jeffery, Oct 19 2017

More terms from Naohiro Nomoto, Jul 03 2001

A006359 Number of distributive lattices; also number of paths with n turns when light is reflected from 6 glass plates.

Original entry on oeis.org

1, 6, 21, 91, 371, 1547, 6405, 26585, 110254, 457379, 1897214, 7869927, 32645269, 135416457, 561722840, 2330091144, 9665485440, 40093544735, 166312629795, 689883899612, 2861717685450, 11870733787751, 49241167758705, 204258021937291, 847285745315256

Offset: 0

N. J. A. Sloane

Let M denotes the 6 X 6 matrix = row by row (1,1,1,1,1,1)(1,1,1,1,1,0)(1,1,1,1,0,0)(1,1,1,0,0,0)(1,1,0,0,0,0)(1,0,0,0,0,0) and A(n) the vector (x(n),y(n),z(n),t(n),u(n),v(n)) = M^n*A where A is the vector (1,1,1,1,1,1) then a(n) = x(n). - Benoit Cloitre, Apr 02 2002

J. Berman and P. Koehler, Cardinalities of finite distributive lattices, Mitteilungen aus dem Mathematischen Seminar Giessen, 121 (1976), 103-124.
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.
J. Haubrich, Multinacci Rijen [Multinacci sequences], Euclides (Netherlands), Vol. 74, Issue 4, 1998, pp. 131-133.
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.
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)
Index entries for linear recurrences with constant coefficients, signature (3,6,-4,-5,1,1).

Cf. A000217, A000330, A050446, A050447, A006356, A006357, A006358.

See also A025030, A030112, A030113, A030114, A030115, A030116.

A=seq(a.j,j=0..5):grammar1:=[Q5,{ seq(Q.i=Union(Epsilon,seq(Prod(a.j,Q.j),j=5-i..5)),i=0..5), seq(a.j=Z,j=0..5) }, unlabeled]: seq(count(grammar1,size=j),j=0..22); # Zerinvary Lajos, Mar 09 2007

LinearRecurrence[{3,6,-4,-5,1,1},{1,6,21,91,371,1547},30] (* Harvey P. Dale, Sep 03 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=6);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)} \\ Paul D. Hanna, Feb 06 2006

G.f.: -(z^4 + z^3 - 3z^2 - 2z + 1) / (-1 + 3z + 6z^2 - 4z^3 - 5z^4 + z^5 + z^6). - M. Goebel (manfredg(AT)ICSI.Berkeley.EDU) Jul 26 1997
a(n) = 3*a(n-1) + 6*a(n-2) - 4*a(n-3) - 5*a(n-4) + a(n-5) + a(n-6).
a(n) is asymptotic to z(6)*w(6)^n where w(6) = (1/2)/cos(6*Pi/13) and z(6) is the root 1 < x < 2 of P(6, X) = -1 - 91*X + 2366*X^2 + 26364*X^3 - 142805*X^4 - 371293*X^5 + 371293*X^6 - Benoit Cloitre, Oct 16 2002
G.f.: A(x) = (1 + 3*x - 3*x^2 - 4*x^3 + x^4 + x^5)/(1 - 3*x - 6*x^2 + 4*x^3 + 5*x^4 - x^5 - x^6). - Paul D. Hanna, Feb 06 2006
G.f.: 1/(-x-1/(-x-1/(-x-1/(-x-1/(-x-1/(-x-1)))))). - Paul Barry, Mar 24 2010

Alternative description from Jacques Haubrich (jhaubrich(AT)freeler.nl)

More terms from James Sellers, Dec 24 1999

A212471 T(n,k)=Number of 0..3 arrays of length n+2k-1 with sum no more than 3k in any length 2k subsequence (=50% duty cycle).

Original entry on oeis.org

10, 150, 30, 2338, 486, 85, 36814, 7862, 1597, 246, 582440, 126606, 27024, 5211, 707, 9240426, 2034200, 445780, 93308, 16649, 2037, 146861788, 32644314, 7274268, 1581686, 321320, 53553, 5864, 2337014158, 523487828, 118029501, 26242268

Offset: 1

R. H. Hardin May 17 2012

Table starts
....10....150.....2338.....36814.....582440.....9240426.....146861788
....30....486.....7862....126606....2034200....32644314.....523487828
....85...1597....27024....445780....7274268...118029501....1908601444
...246...5211....93308...1581686...26242268...430682205....7023308036
...707..16649...321320...5622580...95010466..1578372444...25966120647
..2037..53553..1098260..19960518..344305566..5795798788...96239314549
..5864.172980..3708268..70600212.1246724695.21292987433..357117150362
.16886.558743.12564894.248263590.4504766041.78186208521.1325550644016

			Some solutions for n=3 k=4
..0....2....2....2....2....2....2....2....0....2....0....0....0....0....0....2
..0....2....0....2....2....2....0....0....0....2....0....0....2....0....0....0
..0....2....1....2....2....0....0....0....2....1....1....0....0....1....0....3
..3....2....0....2....0....0....3....0....0....0....0....0....0....0....2....0
..1....0....0....1....0....2....2....1....2....2....0....3....0....0....1....2
..0....0....3....1....3....2....0....3....1....1....0....1....3....0....3....3
..0....0....1....0....0....1....2....0....1....0....0....0....1....0....3....0
..3....0....3....2....3....0....1....0....0....3....0....2....2....0....2....0
..2....1....2....2....0....2....1....0....2....1....3....0....3....2....0....2
..0....0....0....1....1....2....0....1....1....0....2....3....3....0....0....0

R. H. Hardin, Table of n, a(n) for n = 1..936

Column 1 is A006357(n+1)

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

Floor van Lamoen

This sequence is related to the nonagon or 9-gon.

			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).

The a(3*n) lead to A006357; The T(n,k) lead to A076264 and A091024.
Cf. A038196, A038201.
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 *)

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

Edited by Floor van Lamoen, Feb 05 2002

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

A006360 Antichains (or order ideals) in the poset 223n or size of the distributive lattice J(223n).

Original entry on oeis.org

1, 50, 887, 8790, 59542, 307960, 1301610, 4701698, 14975675, 43025762, 113414717, 277904900, 639562508, 1393844960, 2896063220, 5768600412, 11066514565, 20526933442, 36936277875, 64660182026, 110394412610

Offset: 0

N. J. A. Sloane

J. Berman and P. Koehler, Cardinalities of finite distributive lattices, Mitteilungen aus dem Mathematischen Seminar Giessen, 121 (1976), 103-124.
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.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

J. Berman and P. Koehler, Cardinalities of finite distributive lattices, Mitteilungen aus dem Mathematischen Seminar Giessen, 121 (1976), 103-124. [Annotated scanned copy]
G. Kreweras, Les préordres totaux compatibles avec un ordre partiel, Math. Sci. Humaines No. 53 (1976), 5-30.
Feihu Liu, Guoce Xin, and Chen Zhang, Ehrhart Polynomials of Order Polytopes: Interpreting Combinatorial Sequences on the OEIS, arXiv:2412.18744 [math.CO], 2024. See p. 9.
Index entries for sequences related to posets.

Cf. A000217, A000330, A050446, A050447, A006356, A006357, A006358, A006359, A000372, A056932, A006361, A006362, A056933, A056934, A056935, A056936, A056937.

Empirical G.f.: (x+1)*(x^6+36*x^5+279*x^4+594*x^3+279*x^2+36*x+1)/(1-x)^13. - Colin Barker, May 29 2012

More terms from Mitch Harris, Jul 16 2000

A091024 Let v(0) be the column vector (1,0,0,0)'; for n>0, let v(n) = [1 1 1 1 / 1 1 1 0 / 1 1 0 0/ 1 0 0 0] v(n-1). Sequence gives third entry of v(n).

Original entry on oeis.org

0, 1, 2, 7, 19, 56, 160, 462, 1329, 3828, 11021, 31735, 91376, 263108, 757588, 2181389, 6281058, 18085587, 52075371, 149945056, 431749580, 1243173370, 3579575053, 10306975580, 29677753369, 85453685055, 246054079584

Offset: 0

Gary W. Adamson, Dec 14 2003

nonn

First entry of v(n) gives 1,1,4,10,30,85 = A006357 prefixed with an initial 1, the second entry gives 0,1,3,9,26,... = A076264 prefixed with an initial 0.
A sequence derived from 9-gonal diagonal ratios.
a(n)/a(n-1) converges to D = 2.879385... = longest 9-Gon diagonal with edge = 1. E.g., a(7)/a(6) = 707/246 = 2.873983...(a(n)/a(n-1) of all 4 columns converge to 2.8739...). For each row, left to right, terms converge upon 9-Gon ratios: (2.879...):(2.53208...):(1.87938...):(1) Example: row 7 = 707 622 462 246, from A006357, A076264, A091024 and A006357(offset), respectively. The ratios 707/246, 622/246, 462/246 and 246/246 are: (2.8739...):(2.528...):(1.87804...):(1)
From L. Edson Jeffery, Mar 15 2011: (Start)
In fact, the above ratios (2.8739...):(2.528...):(1.87804...):(1) converge to Q_3(w):Q_2(w):Q_1(w):Q_0(w), where the polynomials Q_r(w) are defined by Q_r(w)=w*Q_(r-1)(w)-Q_(r-2)(w) (r>1), Q_0(w)=1, Q_1(w)=w, and w=2*cos(Pi/9).
Moreover, this sequence and a variant of its g.f. are related to rhombus substitution tilings showing 9-fold rotational symmetry (cf. A187503, A187504, A187505, A187506). (End)

			A006357, A076264, a(n) and A006357 (offset) gives the 4 components of v(n) transposed:
1 0 0 0
1 1 1 1
4 3 2 1
10 9 7 4
30 26 19 10
85 75 56 30

Jay Kappraff, "Beyond Measure, A Guided Tour Through Nature, Myth and Number" (p. 497 gives the analogous case for the Heptagon).

Harvey P. Dale, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (2,3,-1,-1).

Cf. A006357, A076264.

a[n_] := (MatrixPower[{{1, 1, 1, 1}, {1, 1, 1, 0}, {1, 1, 0, 0}, {1, 0, 0, 0}}, n].{{1}, {0}, {0}, {0}})[[3, 1]]; Table[ a[n], {n, 0, 26}] (* Robert G. Wilson v, Feb 21 2005 *)
LinearRecurrence[{2,3,-1,-1},{0,1,2,7},30] (* Harvey P. Dale, Feb 18 2016 *)

Recurrence: a(n) = 2*a(n-1) + 3*a(n-2) - a(n-3) - a(n-4), with initial conditions {a(k)}={0,1,2,7}, k=0,1,2,3. - L. Edson Jeffery, Mar 15 2011
G.f.: x/(1 - 2*x - 3*x^2 + x^3 + x^4). - L. Edson Jeffery, Mar 15 2011
G.f.: Q(0)*x/(2+2*x) , where Q(k) = 1 + 1/(1 - x*(12*k-3 + x^2)/( x*(12*k+3 + x^2 ) - 1/Q(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Sep 12 2013

More terms from Robert G. Wilson v, Feb 21 2005

cp's OEIS Frontend

A038235 Bottom line of 4-wave sequence A038197, also bisection of A006357.

Views

Author

Keywords

Links

Programs

Mathematica

PARI

Formula

A038225 Top line of 4-wave sequence A038197, also bisection of A006357.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A006356 a(n) = 2*a(n-1) + a(n-2) - a(n-3) for n >= 3, starting with a(0) = 1, a(1) = 3, and a(2) = 6.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

Maxima

PARI

PARI

Python

Formula

Extensions

A050446 Table read by ascending antidiagonals: T(n, m) giving total degree of n-th-order elementary symmetric polynomials in m variables.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Python

Formula

Extensions

A050447 Table T(n,m) giving total degree of n-th-order elementary symmetric polynomials in m variables, -1 <= n, 1 <= m, transposed and read by upward antidiagonals.

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A006359 Number of distributive lattices; also number of paths with n turns when light is reflected from 6 glass plates.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula

A212471 T(n,k)=Number of 0..3 arrays of length n+2k-1 with sum no more than 3k in any length 2k subsequence (=50% duty cycle).

A006360 Antichains (or order ideals) in the poset 223n or size of the distributive lattice J(223n).