A056236 -id:A056236 - cp's OEIS frontend

A007052 Number of order-consecutive partitions of n.

1, 3, 10, 34, 116, 396, 1352, 4616, 15760, 53808, 183712, 627232, 2141504, 7311552, 24963200, 85229696, 290992384, 993510144, 3392055808, 11581202944, 39540700160, 135000394752, 460920178688, 1573679925248, 5372879343616, 18344157523968, 62630871408640, 213835170586624

Offset: 0

Colin Mallows, N. J. A. Sloane, and Simon Plouffe

After initial terms, first differs from A291292 at a(6) = 1352, A291292(8) = 1353.
Joe Keane (jgk(AT)jgk.org) observes that this sequence (beginning at 3) is "size of raises in pot-limit poker, one blind, maximum raising".
It appears that this sequence is the BinomialMean transform of A001653 (see A075271). - John W. Layman, Oct 03 2002
Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 3, s(2n+1) = 4. - Herbert Kociemba, Jun 12 2004
Equals the INVERT transform of (1, 2, 5, 13, 34, 89, ...). - Gary W. Adamson, May 01 2009
a(n) is the number of compositions of n when there are 3 types of ones. - Milan Janjic, Aug 13 2010
a(n)/a(n-1) tends to (4 + sqrt(8))/2 = 3.414213.... Gary W. Adamson, Jul 30 2013
a(n) is the first subdiagonal of array A228405. - Richard R. Forberg, Sep 02 2013
Number of words of length n over {0,1,2,3,4} in which binary subwords appear in the form 10...0. - Milan Janjic, Jan 25 2017
From Gus Wiseman, Mar 05 2020: (Start)
Also the number of unimodal sequences of length n + 1 covering an initial interval of positive integers, where a sequence of integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence. For example, the a(0) = 1 through a(2) = 10 sequences are:
  (1)  (1,1)  (1,1,1)
       (1,2)  (1,1,2)
       (2,1)  (1,2,1)
              (1,2,2)
              (1,2,3)
              (1,3,2)
              (2,1,1)
              (2,2,1)
              (2,3,1)
              (3,2,1)
Missing are: (2,1,2), (2,1,3), (3,1,2).
Conjecture: Also the number of ordered set partitions of {1..n + 1} where no element of any block is greater than any element of a non-adjacent consecutive block. For example, the a(0) = 1 through a(2) = 10 ordered set partitions are:
  {{1}}  {{1,2}}    {{1,2,3}}
         {{1},{2}}  {{1},{2,3}}
         {{2},{1}}  {{1,2},{3}}
                    {{1,3},{2}}
                    {{2},{1,3}}
                    {{2,3},{1}}
                    {{3},{1,2}}
                    {{1},{2},{3}}
                    {{1},{3},{2}}
                    {{2},{1},{3}}
Cf. A000670, A056242, A332673, A332872. (End)
a(n-1) is the number of hexagonal directed-column convex polyominoes having area n (see Baril et al. at page 4). - Stefano Spezia, Oct 14 2023

			G.f. = 1 + 3*x + 10*x^2 + 34*x^3 + 116*x^4 + 396*x^5 + 1352*x^6 + 4616*x^7 + ...

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
S. Barbero, U. Cerruti, and N. Murru, A Generalization of the Binomial Interpolated Operator and its Action on Linear Recurrent Sequences, J. Int. Seq. 13 (2010) # 10.9.7, proposition 16.
Jean-Luc Baril, José L. Ramírez, and Fabio A. Velandia, Bijections between Directed-Column Convex Polyominoes and Restricted Compositions, September 29, 2023.
Tyler Clark and Tom Richmond, The Number of Convex Topologies on a Finite Totally Ordered Set, 2013, Involve, Vol. 8 (2015), No. 1, 25-32.
Pamela Fleischmann, Jonas Höfer, Annika Huch, and Dirk Nowotka, alpha-beta-Factorization and the Binary Case of Simon's Congruence, arXiv:2306.14192 [math.CO], 2023.
Juan B. Gil and Jessica A. Tomasko, Fibonacci colored compositions and applications, arXiv:2108.06462 [math.CO], 2021.
F. K. Hwang and C. L. Mallows, Enumerating nested and consecutive partitions, Preprint. (Annotated scanned copy)
F. K. Hwang and C. L. Mallows, Enumerating nested and consecutive partitions, J. Combin. Theory Ser. A 70 (1995), no. 2, 323-333.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 164
Mircea Merca, A Note on Cosine Power Sums J. Integer Sequences, Vol. 15 (2012), Article 12.5.3.
J.-C. Novelli and J.-Y. Thibon, Hopf Algebras of m-permutations,(m+1)-ary trees, and m-parking functions, arXiv preprint arXiv:1403.5962 [math.CO], 2014.
N. J. A. Sloane, Transforms
M. Z. Spivey and L. L. Steil, The k-Binomial Transforms and the Hankel Transform, J. Integ. Seqs. Vol. 9 (2006), #06.1.1.
Index entries for sequences related to poker
Index entries for linear recurrences with constant coefficients, signature (4,-2).

Cf. A006012, A003480, A056236.
First differences of A007070.
Cf. A000129, A000670, A001523, A001653, A007068, A035344, A060223, A075271, A227038, A291292, A328509, A332577, A332743, A332873.

[Floor((2+Sqrt(2))^n*(1/2+Sqrt(2)/4)+(2-Sqrt(2))^n*(1/2-Sqrt(2)/4)): n in [0..30] ] ; // Vincenzo Librandi, Aug 20 2011

a[n_]:=(MatrixPower[{{3,1},{1,1}},n].{{2},{1}})[[2,1]]; Table[a[n],{n,0,40}] (* Vladimir Joseph Stephan Orlovsky, Feb 20 2010 *)
a[ n_] := ((2 + Sqrt[2])^(n + 1) + (2 - Sqrt[2])^(n + 1)) / 4 // Simplify; (* Michael Somos, Jan 25 2017 *)
LinearRecurrence[{4, -2}, {1, 3}, 24] (* Jean-François Alcover, Jan 07 2019 *)
unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
allnorm[n_]:=If[n<=0,{{}},Function[s,Array[Count[s,y_/;y<=#]+1&,n]]/@Subsets[Range[n-1]+1]];
Table[Length[Select[Union@@Permutations/@allnorm[n],unimodQ]],{n,6}] (* Gus Wiseman, Mar 06 2020 *)

{a(n) = real((2 + quadgen(8))^(n+1)) / 2}; /* Michael Somos, Mar 06 2003 */

a(n+1) = 4*a(n) - 2*a(n-1).
G.f.: (1-x)/(1-4*x+2*x^2).
Binomial transform of Pell numbers 1, 2, 5, 12, ... (A000129).
a(n) = A006012(n+1)/2 = A056236(n+1)/4. - Michael Somos, Mar 06 2003
a(n) = (A035344(n)+1)/2; a(n) = (2+sqrt(2))^n(1/2+sqrt(2)/4)+(2-sqrt(2))^n(1/2-sqrt(2)/4). - Paul Barry, Jul 16 2003
Second binomial transform of (1, 1, 2, 2, 4, 4, ...). a(n) = Sum_{k=1..floor(n/2)}, C(n, 2k)*2^(n-k-1). - Paul Barry, Nov 22 2003
a(n) = ( (2-sqrt(2))^(n+1) + (2+sqrt(2))^(n+1) )/4. - Herbert Kociemba, Jun 12 2004
a(n) = both left and right terms in M^n * [1 1 1], where M = the 3 X 3 matrix [1 1 1 / 1 2 1 / 1 1 1]. M^n * [1 1 1] = [a(n) A007070(n) a(n)]. E.g., a(3) = 34. M^3 * [1 1 1] = [34 48 34] (center term is A007070(3)). - Gary W. Adamson, Dec 18 2004
The i-th term of the sequence is the entry (2, 2) in the i-th power of the 2 X 2 matrix M = ((1, 1), (1, 3)). - Simone Severini, Oct 15 2005
E.g.f.: exp(2*x)*(cosh(sqrt(2)*x)+sinh(sqrt(2)*x)/sqrt(2)). - Paul Barry, Nov 20 2003
a(n) = A007068(2*n), n>0. - R. J. Mathar, Aug 17 2009
If p[i]=Fibonacci(2i-1) and if A is the Hessenberg matrix of order n defined by: A[i,j]=p[j-i+1], (i<=j), A[i,j]=-1, (i=j+1), and A[i,j]=0 otherwise. Then, for n>=1, a(n-1)= det A. - Milan Janjic, May 08 2010
a(n-1) = Sum_{k=-floor(n/4)..floor(n/4)} (-1)^k*binomial(2*n,n+4*k)/2. - Mircea Merca, Jan 28 2012
G.f.: G(0)*(1-x)/(2*x) + 1 - 1/x, where G(k) = 1 + 1/(1 - x*(2*k-1)/(x*(2*k+1) - (1-x)/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, May 26 2013
a(n) = 3*a(n-1) + a(n-2) + a(n-3) + a(n-4) + ... + a(0). - Gary W. Adamson, Aug 12 2013
a(n) = a(-2-n) * 2^(n+1) for all n in Z. - Michael Somos, Jan 25 2017

A006012 a(0) = 1, a(1) = 2, a(n) = 4a(n-1) - 2a(n-2), n >= 2.

Original entry on oeis.org

1, 2, 6, 20, 68, 232, 792, 2704, 9232, 31520, 107616, 367424, 1254464, 4283008, 14623104, 49926400, 170459392, 581984768, 1987020288, 6784111616, 23162405888, 79081400320, 270000789504, 921840357376, 3147359850496

Offset: 0

N. J. A. Sloane

Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 4, s(2n) = 4. - Herbert Kociemba, Jun 12 2004
a(n-1) counts permutations pi on [n] for which the pairs {i, pi(i)} with i < pi(i), considered as closed intervals [i+1,pi(i)], do not overlap; equivalently, for each i in [n] there is at most one j <= i with pi(j) > i. Counting these permutations by the position of n yields the recurrence relation. - David Callan, Sep 02 2003
a(n) is the sum of (n+1)-th row terms of triangle A140070. - Gary W. Adamson, May 04 2008
The binomial transform is in A083878, the Catalan transform in A084868. - R. J. Mathar, Nov 23 2008
Equals row sums of triangle A152252. - Gary W. Adamson, Nov 30 2008
Counts all paths of length (2*n), n >= 0, starting at the initial node on the path graph P_7, see the second Maple program. - Johannes W. Meijer, May 29 2010
From L. Edson Jeffery, Apr 04 2011: (Start)
Let U_1 and U_3 be the unit-primitive matrices (see [Jeffery])
U_1 = U_(8,1) = [(0,1,0,0); (1,0,1,0); (0,1,0,1); (0,0,2,0)] and
U_3 = U_(8,3) = [(0,0,0,1); (0,0,2,0); (0,2,0,1); (2,0,2,0)]. Then a(n) = (1/4) * Trace(U_1^(2*n)) = (1/2^(n+2)) * Trace(U_3^(2*n)). (See also A084130, A001333.) (End)
Pisano period lengths: 1, 1, 8, 1, 24, 8, 6, 1, 24, 24, 120, 8, 168, 6, 24, 1, 8, 24, 360, 24, ... - R. J. Mathar, Aug 10 2012
a(n) is the first superdiagonal of array A228405. - Richard R. Forberg, Sep 02 2013
Conjecture: With offset 1, a(n) is the number of permutations on [n] with no subsequence abcd such that (i) bc are adjacent in position and (ii) max(a,c) < min(b,d). For example, the 4 permutations of [4] not counted by a(4) are 1324, 1423, 2314, 2413. - David Callan, Aug 27 2014
The conjecture of David Callan above is correct - with offset 1, a(n) is the number of permutations on [n] with no subsequence abcd such that (i) bc are adjacent in position and (ii) max(a,c) < min(b,d). - Yonah Biers-Ariel, Jun 27 2017
From Gary W. Adamson, Jul 22 2016: (Start)
A production matrix for the sequence is M =
  1, 1, 0, 0, 0, 0, ...
  1, 0, 3, 0, 0, 0, ...
  1, 0, 0, 3, 0, 0, ...
  1, 0, 0, 0, 3, 0, ...
  1, 0, 0, 0, 0, 3, ...
  ...
Take powers of M, extracting the upper left terms; getting the sequence starting: (1, 1, 2, 6, 20, 68, ...). (End)
From Gary W. Adamson, Jul 24 2016: (Start)
The sequence is the INVERT transform of the powers of 3 prefaced with a "1": (1, 1, 3, 9, 27, ...) and is N=3 in an infinite of analogous sequences starting:
   N=1 (A000079):  1, 2, 4,  8,  16,   32, ...
   N=2 (A001519):  1, 2, 5, 13,  34,   89, ...
   N=3 (A006012):  1, 2, 6, 20,  68,  232, ...
   N=4 (A052961):  1, 2, 7, 29, 124,  533, ...
   N=5 (A154626):  1, 2, 8, 40, 208, 1088, ...
   N=6:            1, 2, 9, 53, 326, 2017, ...
   ... (End)
Number of permutations of length n > 0 avoiding the partially ordered pattern (POP) {1>2, 1>3, 4>2, 4>3} of length 4. That is, number of length n permutations having no subsequences of length 4 in which the first and fourth elements are larger than the second and third elements. - Sergey Kitaev, Dec 08 2020
a(n-1) is the number of permutations of [n] that can be obtained by placing n points on an X-shape (two crossing lines with slopes 1 and -1), labeling them 1,2,...,n by increasing y-coordinate, and then reading the labels by increasing x-coordinate. - Sergi Elizalde, Sep 27 2021
Consider a stack of pancakes of height n, where the only allowed operation is reversing the top portion of the stack. First, perform a series of reversals of decreasing sizes, followed by a series of reversals of increasing sizes. The number of distinct permutations of the initial stack that can be reached through these operations is a(n). - Thomas Baruchel, May 12 2025
Number of permutations of [n] that are correctly sorted after performing one left-to-right pass and one right-to-left pass of the cocktail sort. - Thomas Baruchel, May 16 2025

D. H. Greene and D. E. Knuth, Mathematics for the Analysis of Algorithms. Birkhäuser, Boston, 3rd edition, 1990, p. 86.
D. E. Knuth, The Art of Computer Programming. Addison-Wesley, Reading, MA, Vol. 3, Sect 5.4.8 Answer to Exer. 8.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Andrei Asinowski and Cyril Banderier, From geometry to generating functions: rectangulations and permutations, arXiv:2401.05558 [cs.DM], 2024. See page 2.
Andrei Asinowski and Toufik Mansour, Separable d-Permutations and Guillotine Partitions, arXiv 0803.3414 [math.CO], 2008. Annals of Combinatorics 14 (1) pp.17-43 Springer, 2010; Abstract
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 155
George Balla, Ghislain Fourier, and Kunda Kambaso, PBW filtration and monomial bases for Demazure modules in types A and C, arXiv:2205.01747 [math.RT], 2022.
M. Barnabei, F. Bonetti, and M. Silimbani, Two permutation classes related to the Bubble Sort operator, Electronic Journal of Combinatorics 19(3) (2012), #P25. - From _N. J. A. Sloane_, Dec 25 2012
Yonah Biers-Ariel, A New Quantity Counted by OEIS Sequence A006012, arXiv:1706.07064 [math.CO], 2017.
Yonah Biers-Ariel, The Number of Permutations Avoiding a Set of Generalized Permutation Patterns, Journal of Integer Sequences, Vol. 20 (2017), Article 17.8.3.
Rocco Chirivì, Xin Fang, and Ghislain Fourier, Degenerate Schubert varieties in type A, Transformation Groups (2020).
CombOS - Combinatorial Object Server, Generate pattern-avoiding permutations
Sergi Elizalde, The X-class and almost-increasing permutations, arXiv:0710.5168 [math:CO], 2007. Ann. Comb. 15 (2011), 51-68.
S. Felsner and D. Heldt, Lattice Path Enumeration and Toeplitz Matrices, J. Int. Seq. 18 (2015) # 15.1.3.
Luca Ferrari, Enhancing the connections between patterns in permutations and forbidden configurations in restricted elections, arXiv:1906.10553 [math.CO], 2019.
Elizabeth Hartung, Hung Phuc Hoang, Torsten Mütze, and Aaron Williams, Combinatorial generation via permutation languages. I. Fundamentals, arXiv:1906.06069 [cs.DM], 2019.
Alice L. L. Gao and Sergey Kitaev, On partially ordered patterns of length 4 and 5 in permutations, arXiv:1903.08946 [math.CO], 2019.
Alice L. L. Gao and Sergey Kitaev, On partially ordered patterns of length 4 and 5 in permutations, The Electronic Journal of Combinatorics 26(3) (2019), P3.26.
L. E. Jeffery, Unit-primitive matrices
Donghyun Kim and Lauren Williams, Schubert polynomials, the inhomogeneous TASEP, and evil-avoiding permutations, arXiv:2106.13378 [math.CO], 2021.
Sergey Kitaev and Artem Pyatkin, On permutations avoiding partially ordered patterns defined by bipartite graphs, arXiv:2204.08936 [math.CO], 2022.
Joshua Marsh and Nathan Williams, Nesting Nonpartitions, J. Int. Seq., Vol. 25 (2022), Article 22.8.8.
Arturo Merino and Torsten Mütze, Combinatorial generation via permutation languages. III. Rectangulations, arXiv:2103.09333 [math.CO], 2021.
Joris Nieuwveld, Fractions, Functions and Folding. A Novel Link between Continued Fractions, Mahler Functions and Paper Folding, Master's Thesis, arXiv:2108.11382 [math.NT], 2021.
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
J. Riordan, The distribution of crossings of chords joining pairs of 2n points on a circle, Math. Comp., 29 (1975), 215-222.
Markus Saers, Dekai Wu, and Chris Quirk, On the Expressivity of Linear Transductions.
Yi-dong Sun and Cang-zhi Jia, Counting Dyck paths with strictly increasing peak sequences, J. Math. Res. Expos. 27 (2) (2007) 253, Theorem 3.11.
Index entries for linear recurrences with constant coefficients, signature (4,-2).

Cf. A000079, A000129, A001333, A001519, A002203, A003480, A007052, A007070, A024175, A030436, A052961, A056236, A083978, A084130, A084868, A094803, A098158, A140070, A147703, A152252, A154626, A201730, A228405, A265185.

a006012 n = a006012_list !! n
a006012_list = 1 : 2 : zipWith (-) (tail $ map (* 4) a006012_list)
(map (* 2) a006012_list)
-- Reinhard Zumkeller, Oct 03 2011

[n le 2 select n else 4*Self(n-1)- 2*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Apr 05 2011

A006012:=-(-1+2*z)/(1-4*z+2*z**2); # Simon Plouffe in his 1992 dissertation
with(GraphTheory): G:=PathGraph(7): A:= AdjacencyMatrix(G): nmax:=24; n2:=2*nmax: for n from 0 to n2 do B(n):=A^n; a(n):=add(B(n)[1,k],k=1..7); od: seq(a(2*n),n=0..nmax); # Johannes W. Meijer, May 29 2010

LinearRecurrence[{4,-2},{1,2},50] (* or *) With[{c=Sqrt[2]}, Simplify[ Table[((2+c)^n+(3+2c)(2-c)^n)/(2(2+c)),{n,50}]]] (* Harvey P. Dale, Aug 29 2011 *)

{a(n) = real(((2 + quadgen(8))^n))}; /* Michael Somos, Feb 12 2004 */

{a(n) = if( n<0, 2^n, 1) * polsym(x^2 - 4*x + 2, abs(n))[abs(n)+1] / 2}; /* Michael Somos, Feb 12 2004 */

Vec((1-2*x)/(1-4*x+2*x^2) + O(x^100)) \\ Altug Alkan, Dec 05 2015

l = [1, 2]
for n in range(2, 101): l.append(4 * l[n - 1] - 2 * l[n - 2])
print(l)  # Indranil Ghosh, Jul 02 2017

A006012=BinaryRecurrenceSequence(4,-2,1,2)
print([A006012(n) for n in range(41)]) # G. C. Greubel, Aug 27 2025

G.f.: (1-2*x)/(1 - 4*x + 2*x^2).
a(n) = 2*A007052(n-1) = A056236(n)/2.
Limit_{n -> oo} a(n)/a(n-1) = 2 + sqrt(2). - Zak Seidov, Oct 12 2002
From Paul Barry, May 08 2003: (Start)
Binomial transform of A001333.
E.g.f.: exp(2*x)*cosh(sqrt(2)*x). (End)
a(n) = Sum_{k=0..floor(n/2)} binomial(n, 2k)*2^(n-k) = Sum_{k=0..n} binomial(n, k)*2^(n-k/2)(1+(-1)^k)/2. - Paul Barry, Nov 22 2003 (typo corrected by Manfred Scheucher, Jan 17 2023)
a(n) = ((2+sqrt(2))^n + (2-sqrt(2))^n)/2.
a(n) = [M^n]{2,2}, where M is the 3 X 3 matrix: M = [1,1,1;1,2,1;1,1,1]. - _Simone Severini, Jun 11 2006
a(n) = Sum_{k=0..n} 2^k*A098158(n,k). - Philippe Deléham, Dec 04 2006
a(n) = A007070(n) - 2*A007070(n-1). - R. J. Mathar, Nov 16 2007
a(n) = Sum_{k=0..n} A147703(n,k). - Philippe Deléham, Nov 29 2008
a(n) = Sum_{k=0..n} A201730(n,k). - Philippe Deléham, Dec 05 2011
G.f.: G(0) where G(k)= 1 + 2*x/((1-2*x) - 2*x*(1-2*x)/(2*x + (1-2*x)*2/G(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Dec 10 2012
G.f.: G(0)*(1-2*x)/2, where G(k) = 1 + 1/(1 - 2*x*(4*k+2-x)/( 2*x*(4*k+4-x) + 1/G(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Jan 27 2014
a(-n) = a(n) / 2^n for all n in Z. - Michael Somos, Aug 24 2014
a(n) = A265185(n) / 4, connecting this sequence to the simple Lie algebra B_4. - Tom Copeland, Dec 04 2015
From G. C. Greubel, Aug 27 2025: (Start)
a(n) = 2^((n-2)/2)*( (n+1 mod 2)*A002203(n) + 2*sqrt(2)*(n mod 2)*A000129(n) ).
a(n) = 2^(n/2)*ChebyshevT(n, sqrt(2)). (End)

A164298 a(n) = ((1+4sqrt(2))(2+sqrt(2))^n + (1-4sqrt(2))(2-sqrt(2))^n)/2.

Original entry on oeis.org

1, 10, 38, 132, 452, 1544, 5272, 18000, 61456, 209824, 716384, 2445888, 8350784, 28511360, 97343872, 332352768, 1134723328, 3874187776, 13227304448, 45160842240, 154188760064, 526433355776, 1797355902976, 6136556900352, 20951515795456, 71532949381120

Offset: 0

Al Hakanson (hawkuu(AT)gmail.com), Aug 12 2009

Binomial transform of A048696. Second binomial transform of A164587. Inverse binomial transform of A164299.

This sequence is part of a class of sequences defined by the recurrence a(n,m) = 2*(m+1)*a(n-1,m) - ((m+1)^2 - 2)*a(n-2,m) with a(0) = 1 and a(1) = m+9. The generating function is Sum_{n>=0} a(n,m)*x^n = (1 - (m-7)*x)/(1 - 2*(m+1)*x + ((m+1)^2 - 2)*x^2) and has a series expansion in terms of Pell-Lucas numbers defined by a(n, m) = (1/2)*Sum_{k=0..n} binomial(n,k)*m^(n-k)*(5*Q(k) + 4*Q(k-1)). - G. C. Greubel, Mar 12 2021

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4,-2).

Sequences in the class a(n, m): this sequence (m=1), A164299 (m=2), A164300 (m=3), A164301 (m=4), A164598 (m=5), A164599 (m=6), A081185 (m=7), A164600 (m=8).
Cf. A007070, A016921, A048696, A056236, A112032, A164587, A241204.
Cf. A016116(n+1).

Z:=PolynomialRing(Integers()); N:=NumberField(x^2-2); S:=[ ((1+4*r)*(2+r)^n+(1-4*r)*(2-r)^n)/2: n in [0..27] ]; [ Integers()!S[j]: j in [1..#S] ]; // Klaus Brockhaus, Aug 17 2009

m:=50; R:=PowerSeriesRing(Integers(), m); Coefficients(R!( (1+6*x)/(1-4*x+2*x^2) )); // G. C. Greubel, Dec 14 2018

a:=n->((1+4*sqrt(2))*(2+sqrt(2))^n+(1-4*sqrt(2))*(2-sqrt(2))^n)/2: seq(floor(a(n)),n=0..25); # Muniru A Asiru, Dec 15 2018

LinearRecurrence[{4,-2}, {1,10}, 50] (* or *) CoefficientList[Series[(1 + 6*x)/(1 - 4*x + 2*x^2), {x,0,50}], x] (* G. C. Greubel, Sep 12 2017 *)

my(x='x+O('x^50)); Vec((1+6*x)/(1-4*x+2*x^2)) \\ G. C. Greubel, Sep 12 2017

[( (1+6*x)/(1-4*x+2*x^2) ).series(x,n+1).list()[n] for n in (0..30)] # G. C. Greubel, Dec 14 2018; Mar 12 2021

a(n) = 4*a(n-1) - 2*a(n-2) for n > 1; a(0)=1, a(1)=10.
G.f.: (1+6*x)/(1-4*x+2*x^2).
E.g.f.: (cosh(sqrt(2)*x) + 4*sqrt(2)*sinh(sqrt(2)*x))*exp(2*x). - G. C. Greubel, Sep 12 2017
From G. C. Greubel, Mar 12 2021: (Start)
a(n) = A056236(n) + 8*A007070(n-1).
a(n) = (1/2)*Sum_{k=0..n} binomial(n,k)*(5*Q(k) + 4*Q(k-1)), where Q(n) = Pell-Lucas(n) = A002203(n). (End)

Edited and extended beyond a(5) by Klaus Brockhaus, Aug 17 2009

A223423 T(n,k)=3-level binary fanout graph coloring a rectangular array: number of nXk 0..6 arrays where 0..6 label nodes of a graph with edges 0,1 1,3 1,4 0,2 2,5 2,6 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.

Original entry on oeis.org

7, 12, 12, 26, 40, 26, 48, 136, 136, 48, 104, 464, 868, 464, 104, 192, 1584, 4720, 4720, 1584, 192, 416, 5408, 29912, 47872, 29912, 5408, 416, 768, 18464, 163168, 486016, 486016, 163168, 18464, 768, 1664, 63040, 1033328, 4934272, 9210784, 4934272

Offset: 1

R. H. Hardin Mar 20 2013

Table starts
....7.....12........26..........48............104..............192
...12.....40.......136.........464...........1584.............5408
...26....136.......868........4720..........29912...........163168
...48....464......4720.......47872.........486016..........4934272
..104...1584.....29912......486016........9210784........150006016
..192...5408....163168.....4934272......150006016.......4565849088
..416..18464...1033328....50097024.....2844612736.....139114196992
..768..63040...5638336...508632832....46345527296....4240305623040
.1664.215232..35704800..5164146176...878977950208..129279082045440
.3072.734848.194827648.52431620096.14321836797952.3941937218551808

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

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

Column 2 is A056236(n+1)

Empirical for column k:
k=1: a(n) = 4*a(n-2) for n>3
k=2: a(n) = 4*a(n-1) -2*a(n-2)
k=3: a(n) = 38*a(n-2) -120*a(n-4) +32*a(n-6)
k=4: a(n) = 14*a(n-1) -36*a(n-2) -40*a(n-3) +88*a(n-4) +32*a(n-5) -32*a(n-6)
k=5: a(n) = 392*a(n-2) -26768*a(n-4) +353408*a(n-6) -1274624*a(n-8) +1441792*a(n-10) -307200*a(n-12) for n>13
k=6: [order 18]
k=7: [order 36]

A060995 Number of routes of length 2n on the sides of an octagon from a point to opposite point.

Original entry on oeis.org

0, 2, 8, 28, 96, 328, 1120, 3824, 13056, 44576, 152192, 519616, 1774080, 6057088, 20680192, 70606592, 241065984, 823050752, 2810071040, 9594182656, 32756588544, 111837988864, 381838778368, 1303679135744

Offset: 1

Henry Bottomley, May 13 2001

Also the 2nd row in the 2-shuffle Phi_2(W(sqrt(2))) of the Fraenkel-Kimberling publication. - R. J. Mathar, Aug 17 2009

First differences of A056236. - Jeremy Gardiner, Aug 11 2013

Harry J. Smith, Table of n, a(n) for n=1,...,200
Tomislav Doslic, I. Zubac, Counting maximal matchings in linear polymers, Ars Mathematica Contemporanea 11 (2016) 255-276.
International Mathematical Olympiad, 1979 Problem 6
A. S. Fraenkel, C. Kimberling, Generalized Wythoff arrays, shuffles and interspersions, Discr. Math. 126 (1-3) (1994) 137-149. [From _R. J. Mathar_, Aug 17 2009]
Index entries for linear recurrences with constant coefficients, signature (4, -2).

LinearRecurrence[{4,-2},{0,2},40] (* Harvey P. Dale, Mar 03 2012 *)

{ for (n=1, 200, if (n>2, a=4*a1 - 2*a2; a2=a1; a1=a, if (n==1, a=a2=0, a=a1=2)); write("b060995.txt", n, " ", a) ) } \\ Harry J. Smith, Jul 16 2009

[(lucas_number2(n,4,2)-lucas_number2(n-1,4,2)) for n in range(0, 24)] # Zerinvary Lajos, Nov 10 2009

G.f.: 2*x^2/(1-4*x+2*x^2).
a(n) = (2 + sqrt(2))^(n-1)/sqrt(2) - (2-sqrt(2))^(n-1)/sqrt(2).
a(n) = 4*a(n-1)-2*a(n-2).
a(n) = 2*A007070(n-2)
G.f.: G(0)/(2*x) - 1/x, where G(k)= 1 + 1/( 1 - 4*x^2/(4*x^2 + 2*(1-2*x)^2/G(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Jul 16 2013

A265185 Non-vanishing traces of the powers of the adjacency matrix for the simple Lie algebra B_4: 2 * ((2 + sqrt(2))^n + (2 - sqrt(2))^n).

Original entry on oeis.org

4, 8, 24, 80, 272, 928, 3168, 10816, 36928, 126080, 430464, 1469696, 5017856, 17132032, 58492416, 199705600, 681837568, 2327939072, 7948081152, 27136446464, 92649623552, 316325601280, 1080003158016, 3687361429504, 12589439401984, 42983034748928

Offset: 0

Tom Copeland, Dec 04 2015

a(n) is the trace of the 2*n-th power of the adjacency matrix M for the simple Lie algebra B_4, given in the Damianou link. M = Matrix[row 1; row 2; row 3; row 4] = Matrix[0,1,0,0; 1,0,1,0; 0,1,0,2; 0,0,1,0]. Equivalently, the trace tr(M^(2*k)) is the sum of the 2*n-th powers of the eigenvalues of M. The eigenvalues are the zeros of the characteristic polynomial of M, which is det(x*I - M) = x^4 - 4*x^2 + 2 = A127672(4,x), and are (+-) sqrt(2 + sqrt(2)) and (+-) sqrt(2 - sqrt(2)), or the four unique values generated by 2*cos((2*n+1)*Pi/8). Compare with A025192 for B_3. The odd power traces vanish.
-log(1 - 4*x^2 + 2*x^4) = 8*x^2/2 + 24*x^4/4 + 80*x^6/6 + ... = Sum_{n>0} tr(M^k) x^k / k = Sum_{n>0} a(n) x^(2k) / 2k gives an aerated version of the sequence a(n), excluding a(0), and exp(-log(1 - 4*x + 2*x^2)) = 1 / (1 - 4*x + 2*x^2) is the e.g.f. for A007070.
As in A025192, the cycle index partition polynomials P_k(x[1],...,x[k]) of A036039 evaluated with the negated power sums, the aerated a(n), are P_2(0,-a(1)) = P_2(0,-8) = -8, P_4(0,-a(1),0,-a(2)) = P_4(0,-8,0,-24) = 48, and all other P_k(0,-a(1),0,-a(2),0,...) = 0 since 1 - 4*x^2 + 2*x^4 = 1 - 8*x^2/2! + 48*x^4/4! = det(I - x M) = exp(-Sum_{k>0} tr(M^k) x^k / k) = exp[P.(-tr(M),-tr(M^2),...)x] = exp[P.(0,-a(1),0,-a(2),...)x].
Because of the inverse relation between the Faber polynomials F_n(b1,b2,...,bn) of A263916 and the cycle index polynomials, F_n(0,-4,0,2,0,0,0,...) = tr(M^n) gives aerated a(n), excluding a(0). E.g., F_2(0,-4) = -2 * -4 = 8, F_4(0,-4,0,2) = -4 * 2 + 2 * (-4)^2 = 24, and F_6(0,-4,0,2,0,0) = -2*(-4)^3 + 6*(-4)*2 = 80.

G. C. Greubel, Table of n, a(n) for n = 0..1000
P. Damianou, On the characteristic polynomials of Cartan matrices and Chebyshev polynomials, arXiv preprint arXiv:1110.6620 [math.RT], 2011-2014.
Index entries for linear recurrences with constant coefficients, signature (4,-2).

Cf. A006012, A007052, A007070, A025192, A036039, A056236, A127672, A189315, A263916.

[Floor(2 * ((2 + Sqrt(2))^n + (2 - Sqrt(2))^n)): n in [0..30]]; // Vincenzo Librandi, Dec 06 2015

4 LinearRecurrence[{4, -2}, {1, 2}, 30] (* Vincenzo Librandi, Dec 06 2015 and slightly modified by Robert G. Wilson v, Feb 13 2018 *)

my(x='x+O('x^30)); Vec((4-8*x)/(1-4*x+2*x^2)) \\ G. C. Greubel, Feb 12 2018

a(n) = 2 * ((2 + sqrt(2))^n + (2 - sqrt(2))^n) = Sum_{k=0..3} 2^(2n) (cos((2k+1)*Pi/8))^(2n) = 2*2^(2n) (cos(Pi/8)^(2n) + cos(3*Pi/8)^(2n)) = 2 Sum_{k=0..1} (exp(i(2k+1)*Pi/8) + exp(-i*(2k+1)*Pi/8))^(2n).
E.g.f.: 2 * e^(2*x) * (e^(sqrt(2)*x) + e^(-sqrt(2)*x)) = 4*e^(2*x)*cosh(sqrt(2)*x) = 2*(exp(4*x*cos(Pi/8)^2) + exp(4*x cos(3*Pi/8)^2) ).
a(n) = 4*A006012(n) = 8*A007052(n-1) = 2*A056236(n).
G.f.: (4-8*x)/(1-4*x+2*x^2). - Robert Israel, Dec 07 2015
Note the preceding o.g.f. is four times that of A006012 and the denominator is y^4 * A127672(4,1/y) with y = sqrt(x). Compare this with those of A025192 and A189315. - Tom Copeland, Dec 08 2015

More terms from Vincenzo Librandi, Dec 06 2015

A191348 Array read by antidiagonals: ((ceiling(sqrt(n)) + sqrt(n))^k + (ceiling(sqrt(n)) - sqrt(n))^k)/2 for columns k >= 0 and rows n >= 0.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 2, 2, 1, 0, 4, 6, 2, 1, 0, 8, 20, 7, 2, 1, 0, 16, 68, 26, 8, 3, 1, 0, 32, 232, 97, 32, 14, 3, 1, 0, 64, 792, 362, 128, 72, 15, 3, 1, 0, 128, 2704, 1351, 512, 376, 81, 16, 3, 1, 0

Offset: 0

Charles L. Hohn, May 31 2011

			1, 0,  0,   0,    0,     0,      0,      0,       0,        0,         0, ...
1, 1,  2,   4,    8,    16,     32,     64,     128,      256,       512, ...
1, 2,  6,  20,   68,   232,    792,   2704,    9232,    31520,    107616, ...
1, 2,  7,  26,   97,   362,   1351,   5042,   18817,    70226,    262087, ...
1, 2,  8,  32,  128,   512,   2048,   8192,   32768,   131072,    524288, ...
1, 3, 14,  72,  376,  1968,  10304,  53952,  282496,  1479168,   7745024, ...
1, 3, 15,  81,  441,  2403,  13095,  71361,  388881,  2119203,  11548575, ...
1, 3, 16,  90,  508,  2868,  16192,  91416,  516112,  2913840,  16450816, ...
1, 3, 17,  99,  577,  3363,  19601, 114243,  665857,  3880899,  22619537, ...
1, 3, 18, 108,  648,  3888,  23328, 139968,  839808,  5038848,  30233088, ...
1, 4, 26, 184, 1316,  9424,  67496, 483424, 3462416, 24798784, 177615776, ...
1, 4, 27, 196, 1433, 10484,  76707, 561236, 4106353, 30044644, 219825387, ...
1, 4, 28, 208, 1552, 11584,  86464, 645376, 4817152, 35955712, 268377088, ...
1, 4, 29, 220, 1673, 12724,  96773, 736012, 5597777, 42574180, 323800109, ...
1, 4, 30, 232, 1796, 13904, 107640, 833312, 6451216, 49943104, 386642400, ...
...

Row 1 is A000007, row 2 is A011782, row 3 is A006012, row 4 is A001075, row 5 is A081294, row 6 is A098648, row 7 is A084120, row 8 is A146963, row 9 is A001541, row 10 is A081341, row 11 is A084134, row 13 is A090965.
Row 3*2 is A056236, row 4*2 is A003500, row 5*2 is A155543, row 9*2 is A003499.
Cf. A191347 which uses floor() in place of ceiling().

T(n, k) = if (k==0, 1, if (k==1, ceil(sqrt(n)), T(n,k-2)*(n-T(n,1)^2) + T(n,k-1)*T(n,1)*2));
matrix(9, 9, n, k, T(n-1, k-1)) \\ Charles L. Hohn, Aug 23 2019

For each row n >= 0 let T(n,0)=1 and T(n,1) = ceiling(sqrt(n)), then for each column k >= 2: T(n,k) = T(n,k-2)*(n-T(n,1)^2) + T(n,k-1)*T(n,1)*2. - Charles L. Hohn, Aug 23 2019

cp's OEIS Frontend

A228568 a(n) = 2^n*A056236(n).

Views

Author

Keywords

Comments

Links

Programs

PARI

Formula

A007052 Number of order-consecutive partitions of n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A006012 a(0) = 1, a(1) = 2, a(n) = 4*a(n-1) - 2*a(n-2), n >= 2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

PARI

Python

SageMath

Formula

A164298 a(n) = ((1+4*sqrt(2))*(2+sqrt(2))^n + (1-4*sqrt(2))*(2-sqrt(2))^n)/2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A223423 T(n,k)=3-level binary fanout graph coloring a rectangular array: number of nXk 0..6 arrays where 0..6 label nodes of a graph with edges 0,1 1,3 1,4 0,2 2,5 2,6 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A060995 Number of routes of length 2n on the sides of an octagon from a point to opposite point.

Views

Author

Keywords

Comments

Links

Programs

Mathematica

PARI

Sage

Formula

A265185 Non-vanishing traces of the powers of the adjacency matrix for the simple Lie algebra B_4: 2 * ((2 + sqrt(2))^n + (2 - sqrt(2))^n).

A006012 a(0) = 1, a(1) = 2, a(n) = 4a(n-1) - 2a(n-2), n >= 2.

A164298 a(n) = ((1+4sqrt(2))(2+sqrt(2))^n + (1-4sqrt(2))(2-sqrt(2))^n)/2.