A265584 -id:A265584 - cp's OEIS frontend

A006355 Number of binary vectors of length n containing no singletons.

1, 0, 2, 2, 4, 6, 10, 16, 26, 42, 68, 110, 178, 288, 466, 754, 1220, 1974, 3194, 5168, 8362, 13530, 21892, 35422, 57314, 92736, 150050, 242786, 392836, 635622, 1028458, 1664080, 2692538, 4356618, 7049156, 11405774, 18454930, 29860704, 48315634

Offset: 0

David M. Bloom

Number of cvtemplates at n-2 letters given <= 2 consecutive consonants or vowels (n >= 4).
Number of (n,2) Freiman-Wyner sequences.
Diagonal sums of the Riordan array ((1-x+x^2)/(1-x), x/(1-x)), A072405 (where this begins 1,0,1,1,1,1,...). - Paul Barry, May 04 2005
Central terms of the triangle in A094570. - Reinhard Zumkeller, Mar 22 2011
Pisano period lengths: 1, 1, 8, 3, 20, 8, 16, 6, 24, 20, 10, 24, 28, 16, 40, 12, 36, 24, 18, 60, ... . - R. J. Mathar, Aug 10 2012
Also the number of matchings in the (n-2)-pan graph for n >= 5. - Eric W. Weisstein, Oct 03 2017
a(n) is the number of bimultus bitstrings of length n. A bitstring is bimultus if each of its 1's possess at least one neighboring 1 and each of its 0's possess at least one neighboring 0. - Steven Finch, May 26 2020

			a(6)=10 because we have: 000000, 000011, 000111, 001100, 001111, 110000, 110011, 111000, 111100, 111111. - _Geoffrey Critzer_, Jan 26 2014

A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, id. 16, 51.

Charles R Greathouse IV, Table of n, a(n) for n = 0..4786 (next term has 1001 digits)
Kassie Archer and Aaron Geary, Powers of permutations that avoid chains of patterns, arXiv:2312.14351 [math.CO], 2023. See p. 15.
J. Berman and P. Koehler, Cardinalities of finite distributive lattices, Mitteilungen aus dem Mathematischen Seminar Giessen, 121 (1976), 103-124. [Annotated scanned copy]
Ian F. Blake, The enumeration of certain run length sequences, Information and Control, 55 (1982), 222-237.
Alexander Burstein, Sergey Kitaev, and Toufik Mansour, Partially ordered patterns and their combinatorial interpretations, PU. M. A. Vol. 19 (2008), No. 2-3, pp. 27-38.
Steven Finch, Variance of longest run duration in a random bitstring, arXiv:2005.12185 [math.CO], 2020.
Enoch Haga, Room for Expansion, Word Ways, 33 (No. 2, 2000), pp. 106-113 (see p. 110).
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 898.
Sergey Kitaev and Jeffrey Remmel, (a,b)-rectangle patterns in permutations and words, arXiv:1304.4286 [math.CO], 2013.
Thor Martinsen, Non-Fisherian generalized Fibonacci numbers, Notes Num. Theor. Disc. Math. (2025) Vol. 31, No. 2, 370-389. See p. 389.
Noriaki Sannomiya, Hosho Katsura, and Yu Nakayama, Supersymmetry breaking and Nambu-Goldstone fermions with cubic dispersion, arXiv preprint arXiv:1612.02285 [cond-mat.str-el], 2016-2017. See Table II, line 2.
Eric Weisstein's World of Mathematics, Independent Edge Set, Matching and Pan Graph.
Index entries for linear recurrences with constant coefficients, signature (1,1).

Except for initial term, = 2*Fibonacci numbers (A000045).
Essentially the same as A047992, A054886, A055389, A068922, and A090991.
Column 2 in A265584.
Cf. A094570, A097925, A097926, A118658, A119457.

a006355 n = a006355_list !! n
a006355_list = 1 : fib2s where
   fib2s = 0 : map (+ 1) (scanl (+) 1 fib2s)
-- Reinhard Zumkeller, Mar 20 2013

[1] cat [Lucas(n) - Fibonacci(n): n in [1..50]]; // Vincenzo Librandi, Aug 02 2014

a:= n-> if n=0 then 1 else (Matrix([[2,-2]]). Matrix([[1,1], [1,0]])^n) [1,1] fi: seq(a(n), n=0..38); # Alois P. Heinz, Aug 18 2008
a := n -> ifelse(n=0, 1, -2*I^n*ChebyshevU(n-2, -I/2)):
seq(simplify(a(n)), n = 0..38);  # Peter Luschny, Dec 03 2023

Join[{1}, Last[#] - First[#] & /@ Partition[Fibonacci[Range[-1, 40]], 4, 1]] (* Harvey P. Dale, Sep 30 2011 *)
Join[{1}, LinearRecurrence[{1, 1}, {0, 2}, 38]] (* Jean-François Alcover, Sep 23 2017 *)
(* Programs from Eric W. Weisstein, Oct 03 2017 *)
Join[{1}, Table[2 Fibonacci[n], {n, 0, 40}]]
Join[{1}, 2 Fibonacci[Range[0, 40]]]
CoefficientList[Series[(1-x+x^2)/(1-x-x^2), {x, 0, 40}], x] (* End *)

a(n)=if(n,2*fibonacci(n-1),1) \\ Charles R Greathouse IV, Mar 14 2012

my(x='x+O('x^50)); Vec((1-x+x^2)/(1-x-x^2)) \\ Altug Alkan, Nov 01 2015

def A006355(n): return 2*fibonacci(n-1) - int(n==0)
print([A006355(n) for n in range(51)]) # G. C. Greubel, Apr 18 2025

a(n+2) = F(n-1) + F(n+2), for n > 0.
G.f.: (1-x+x^2)/(1-x-x^2). - Paul Barry, May 04 2005
a(n) = A119457(n-1,n-2) for n > 2. - Reinhard Zumkeller, May 20 2006
a(n) = 2*F(n-1) for n > 0, F(n)=A000045(n) and a(0)=1. - Mircea Merca, Jun 28 2012
G.f.: 1 - x + x*Q(0), where Q(k) = 1 + x^2 + (2*k+3)*x - x*(2*k+1 + x)/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, Oct 05 2013
a(n) = A118658(n) - 0^n. - M. F. Hasler, Nov 05 2014
a(n) = 2^(-n)*((1+r)*(1-r)^n - (1-r)*(1+r)^n)/r for n > 0, where r=sqrt(5). - Colin Barker, Jan 28 2017
a(n) = a(n-1) + a(n-2) for n >= 3. - Armend Shabani, Nov 25 2020
E.g.f.: 2*exp(x/2)*(5*cosh(sqrt(5)*x/2) - sqrt(5)*sinh(sqrt(5)*x/2))/5 - 1. - Stefano Spezia, Apr 18 2022
a(n) = F(n-3) + F(n-2) + F(n-1) for n >= 3, where F(n)=A000045(n). - Gergely Földvári, Aug 03 2024

Corrected by T. D. Noe, Oct 31 2006

A121907 Expansion of g.f.: (1 + x + x^2)/(1 - 2x - 2x^2).

Original entry on oeis.org

1, 3, 9, 24, 66, 180, 492, 1344, 3672, 10032, 27408, 74880, 204576, 558912, 1526976, 4171776, 11397504, 31138560, 85072128, 232421376, 634987008, 1734816768, 4739607552, 12948848640, 35376912384, 96651522048, 264056868864, 721416781824, 1970947301376

Offset: 0

N. J. A. Sloane, Nov 20 2006

a(n-1) is the number of compositions of n into floor((3*j-1)/2) kinds of j's for all j >= 1. The sequence of such compositions is 1,1,3,9,24,... (i.e., this sequence prepended by 1) and has g.f. 1/(1-Sum_{j>=1} floor((3*j-1)/2)*x^j). - Joerg Arndt, Jul 06 2011

a(n) is the number of length n words on 3 letters (ternary words) such that the length of any run of identical letters is <= 2. Cf. A181137 for a generalization. - Geoffrey Critzer, Sep 16 2013

A. Burstein and T. Mansour, Words restricted by 3-letter generalized multipermutation patterns, Annals. Combin., 7 (2003), 1-14.

G. C. Greubel, Table of n, a(n) for n = 0..1000
A. Burstein and T. Mansour, Words restricted by 3-letter generalized multipermutation patterns, arXiv:math/0112281 [math.CO], 2001.
Martin Burtscher, Igor Szczyrba, Rafał Szczyrba, Analytic Representations of the n-anacci Constants and Generalizations Thereof, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.5.
Index entries for linear recurrences with constant coefficients, signature (2,2).

Column 3 in A265584.

a:=[3,9];; for n in [3..30] do a[n]:=2*(a[n-1]+a[n-2]); od; Concatenation([1], a); # G. C. Greubel, Oct 07 2019

R:=PowerSeriesRing(Integers(), 30); Coefficients(R!( (1+x+x^2)/(1-2*x-2*x^2) )); // G. C. Greubel, Oct 07 2019

seq(coeff(series((1+x+x^2)/(1-2*x-2*x^2), x, n+1), x, n), n = 0..30); # G. C. Greubel, Oct 07 2019

CoefficientList[Series[(1+x+x^2)/(1-2x-2x^2),{x,0,30}],x] (* or *) LinearRecurrence[{2,2},{1,3,9},30] (* Harvey P. Dale, Dec 03 2011 *)

my(x='x+O('x^30)); Vec((1+x+x^2)/(1-2*x-2*x^2)) \\ G. C. Greubel, Oct 07 2019

def A121907_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P((1+x+x^2)/(1-2*x-2*x^2)).list()
A121907_list(30) # G. C. Greubel, Oct 07 2019

a(0)=1, a(1)=3, a(2)=9; a(n) = 2*a(n-1) + 2*a(n-2) for n>=3. - Philippe Deléham, Sep 19 2009
G.f.: (1/x)*(-1 + 1/(1-Sum_{j>=1} floor((3*j-1)/2)*x^j)). - Joerg Arndt, Jul 06 2011
E.g.f.: (1/2)*exp(x)*(3*cosh(sqrt(3)*x) + sqrt(3)*sinh(sqrt(3)*x)) - 1/2. - Stefano Spezia, Oct 08 2019

A265583 Array T(n,k) = k*(k-1)^(n-1) read by ascending antidiagonals; k,n >= 1.

Original entry on oeis.org

1, 0, 2, 0, 2, 3, 0, 2, 6, 4, 0, 2, 12, 12, 5, 0, 2, 24, 36, 20, 6, 0, 2, 48, 108, 80, 30, 7, 0, 2, 96, 324, 320, 150, 42, 8, 0, 2, 192, 972, 1280, 750, 252, 56, 9, 0, 2, 384, 2916, 5120, 3750, 1512, 392, 72, 10, 0, 2, 768, 8748, 20480, 18750, 9072, 2744, 576, 90, 11

Offset: 1

R. J. Mathar, Dec 10 2015

T(n,k) is the number of n-letter words in a k-letter alphabet with no adjacent letters the same. The factor k represents the number of choices of the first letter, and the n-1 times repeated factor k-1 represents the choices of the next n-1 letters avoiding their predecessor.

The antidiagonal sums are s(d) = 1, 2, 5, 12, 31, 88, 275, 942, 3513, 14158, 61241, 282632, .. for d = n+k >= 2.

			      1       2       3       4       5       6       7
      0       2       6      12      20      30      42
      0       2      12      36      80     150     252
      0       2      24     108     320     750    1512
      0       2      48     324    1280    3750    9072
      0       2      96     972    5120   18750   54432
      0       2     192    2916   20480   93750  326592
T(3,3)=12 counts aba, abc, aca, acb, bab, bac, bca, bcb, cab, cac, cba, cbc. Words like aab or cbb are not counted.

Robert Israel, Table of n, a(n) for n = 1..10011(first 141 antidiagonals, flattened)

Cf. A007283 (column 3), A003946 (column 4), A003947 (column 5), A002378 (row 2), A011379 (row 3), A179824 (row 4), A055897 (diagonal), A265584.

T:= function(n,k)
    if (n=1 and k=1) then return 1;
    else return k*(k-1)^(n-k-1);
    fi;
  end;
Flat(List([2..15], n-> List([1..n-1], k-> T(n,k) ))); # G. C. Greubel, Aug 10 2019

T:= func< n,k | (n eq 1 and k eq 1) select 1 else k*(k-1)^(n-k-1) >;
[T(n,k): k in [1..n-1], n in [2..15]]; // G. C. Greubel, Aug 10 2019

A265583 := proc(n,k)
    k*(k-1)^(n-1) ;
end proc:
seq(seq( A265583(d-k,k),k=1..d-1),d=2..13) ;

T[1,1] = 1; T[n_, k_] := If[k==1, 0, k*(k-1)^(n-1)]; Table[T[n-k,k], {n,2,12}, {k,1,n-1}] // Flatten (* Amiram Eldar, Dec 13 2018 *)

T(n,k) = if(n==k==1, 1, k*(k-1)^(n-k-1) );
for(n=2,15, for(k=1,n-1, print1(T(n,k), ", "))) \\ G. C. Greubel, Aug 10 2019

def T(n, k):
    if (n==k==1): return 1
    else: return k*(k-1)^(n-k-1)
[[T(n, k) for k in (1..n-1)] for n in (2..15)] # G. C. Greubel, Aug 10 2019

T(n,k) = k*A051129(n-1,k-1) = k*A003992(k-1,n-1).
G.f. for column k: k*x/(1-(k-1)*x). - R. J. Mathar, Dec 12 2015
G.f. for array: y/(y-1) - (1+1/x)*y*LerchPhi(y,1,-1/x). - Robert Israel, Dec 13 2018

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

Original entry on oeis.org

1, 4, 16, 60, 228, 864, 3276, 12420, 47088, 178524, 676836, 2566080, 9728748, 36884484, 139839696, 530172540, 2010036708, 7620627744, 28891993356, 109537863300, 415289569968, 1574482299804, 5969315609316, 22631393727360, 85802128010028, 325300565212164

Offset: 0

N. J. A. Sloane, Nov 20 2006

From Johannes W. Meijer, Aug 14 2010: (Start)
A berserker sequence, see A180141. For the corner squares 16 A[5] vectors with decimal values between 3 and 384 lead to this sequence. These vectors lead for the side squares to A180142 and for the central square to A155116.
This sequence belongs to a family of sequences with GF(x) = (1+x+k*x^2)/(1-3*x+(k-4)*x^2). Berserker sequences that are members of this family are 4*A055099(n) (k=2; with leading 1 added), A123620 (k=1; this sequence), A000302 (k=0), 4*A179606 (k=-1; with leading 1 added) and A180141 (k=-2). Some other members of this family are 4*A003688 (k=3; with leading 1 added), 4*A003946 (k=4; with leading 1 added), 4*A002878 (k=5; with leading 1 added) and 4*A033484 (k=6; with leading 1 added).
(End)
a(n) is the number of length n sequences on an alphabet of 4 letters that do not contain more than 2 consecutive equal letters. For example, a(3)=60 because we count all 4^3=64 words except: aaa, bbb, ccc, ddd. - Geoffrey Critzer, Mar 12 2014

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
A. Burstein and T. Mansour, Words restricted by 3-letter generalized multipermutation patterns, arXiv:math/0112281 [math.CO], 2001.
A. Burstein and T. Mansour, Words restricted by 3-letter generalized multipermutation patterns, Annals. Combin., 7 (2003), 1-14.
Martin Burtscher, Igor Szczyrba, Rafał Szczyrba, Analytic Representations of the n-anacci Constants and Generalizations Thereof, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.5.
P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009; see page 205
Index entries for linear recurrences with constant coefficients, signature (3,3).

Column 4 in A265584.

[1] cat [Round(((2^(1-n)*(-(3-Sqrt(21))^(1+n) + (3+Sqrt(21))^(1+n))))/(3*Sqrt(21))): n in [1..50]]; // G. C. Greubel, Oct 26 2017

nn=25;CoefficientList[Series[(1-z^(m+1))/(1-r z +(r-1)z^(m+1))/.{r->4,m->2},{z,0,nn}],z] (* Geoffrey Critzer, Mar 12 2014 *)
CoefficientList[Series[(1 + x + x^2)/(1 - 3 x - 3 x^2), {x, 0, 40}], x] (* Vincenzo Librandi, Mar 14 2014 *)
LinearRecurrence[{3,3},{1,4,16},30] (* Harvey P. Dale, Jul 14 2023 *)

my(x='x+O('x^50)); Vec((1+x+x^2)/(1-3*x-3*x^2)) \\ G. C. Greubel, Oct 16 2017

a(0)=1, a(1)=4, a(2)=16, a(n)=3*a(n-1)+3*a(n-2) for n>2. - Philippe Deléham, Sep 18 2009

a(n) = ((2^(1-n)*(-(3-sqrt(21))^(1+n) + (3+sqrt(21))^(1+n)))) / (3*sqrt(21)) for n>0. - Colin Barker, Oct 17 2017

A265624 Array T(n,k): The number of words of length n in an alphabet of size k which do not contain 4 consecutive letters.

Original entry on oeis.org

1, 1, 2, 1, 4, 3, 0, 8, 9, 4, 0, 14, 27, 16, 5, 0, 26, 78, 64, 25, 6, 0, 48, 228, 252, 125, 36, 7, 0, 88, 666, 996, 620, 216, 49, 8, 0, 162, 1944, 3936, 3080, 1290, 343, 64, 9, 0, 298, 5676, 15552, 15300, 7710, 2394, 512, 81, 10, 0, 548, 16572, 61452

Offset: 1

R. J. Mathar, Dec 10 2015

			  1    2      3      4      5       6       7        8
  1    4      9     16     25      36      49       64
  1    8     27     64    125     216     343      512
  0   14     78    252    620    1290    2394     4088
  0   26    228    996   3080    7710   16716    32648
  0   48    666   3936  15300   46080  116718   260736
  0   88   1944  15552  76000  275400  814968  2082304
  0  162   5676  61452 377520 1645950 5690412 16629816

Cf. A135491 (column k=2), A181137 (k=3), A188714 (k=4), A265583 (not 2 consecutive letters), A265584 (not 3 consecutive letters).

A265624 := proc(n,k)
        local x;
        k*x*(1+x+x^2)/(1+(1-k)*x*(x^2+x+1)) ;
        coeftayl(%,x=0,n) ;
end proc;
seq(seq(A265624(d-k,k),k=1..d-1),d=2..10) ;

T(2,k) = k^2.
T(3,k) = k^3.
T(4,k) = k*(k+1)*(k^2+3*k+3).
T(5,k) = k*(k+1)*(k^3+4*k^2+6*k+2).
T(6,k) = k*(k+1)^2*(k^3+4*k^2+6*k+1).
G.f. of row k: k*x*(1+x+x^2)/(1+(1-k)*x*(x^2+x+1)).

A123871 Expansion of g.f.: (1+x+x^2)/(1-4x-4x^2).

Original entry on oeis.org

1, 5, 25, 120, 580, 2800, 13520, 65280, 315200, 1521920, 7348480, 35481600, 171320320, 827207680, 3994112000, 19285278720, 93117562880, 449611366400, 2170915717120, 10482108334080, 50612096204800, 244376818155520, 1179955657441280, 5697329902387200

Offset: 0

N. J. A. Sloane, Nov 20 2006

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
A. Burstein and T. Mansour, Words restricted by 3-letter ..., Annals of Combinatorics 7 (2003), 1-14. arXiv:math.CO/0112281
Martin Burtscher, Igor Szczyrba, Rafał Szczyrba, Analytic Representations of the n-anacci Constants and Generalizations Thereof, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.5.
Index entries for linear recurrences with constant coefficients, signature (4,4).

Column 5 in A265584.

a:=[1,5,25];; for n in [4..30] do a[n]:=4*a[n-1]+4*a[n-2]; od; a; # G. C. Greubel, Aug 08 2019

I:=[1, 5, 25]; [n le 3 select I[n] else 4*Self(n-1)+4*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Jun 27 2012

seq(coeff(series((1+x+x^2)/(1-4*x-4*x^2), x, n+1), x, n), n = 0..30); # G. C. Greubel, Aug 08 2019

CoefficientList[Series[(1+x+x^2)/(1-4*x-4*x^2),{x,0,30}],x] (* Vincenzo Librandi, Jun 27 2012 *)
LinearRecurrence[{4,4},{1,5,25},30] (* Harvey P. Dale, Mar 25 2022 *)

my(x='x+O('x^30)); Vec((1+x+x^2)/(1-4*x-4*x^2)) \\ G. C. Greubel, Aug 08 2019

def A123871_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( (1+x+x^2)/(1-4*x-4*x^2) ).list()
A123871_list(30) # G. C. Greubel, Aug 08 2019

a(n) = 4*a(n-1) + 4*a(n-2) for n>2. - Philippe Deléham, Sep 19 2009

A123887 Expansion of g.f.: (1+x+x^2)/(1-5x-5x^2).

Original entry on oeis.org

1, 6, 36, 210, 1230, 7200, 42150, 246750, 1444500, 8456250, 49503750, 289800000, 1696518750, 9931593750, 58140562500, 340360781250, 1992506718750, 11664337500000, 68284221093750, 399742792968750, 2340135070312500, 13699389316406250, 80197621933593750, 469485056250000000

Offset: 0

N. J. A. Sloane, Nov 20 2006

G. C. Greubel, Table of n, a(n) for n = 0..1000
A. Burstein and T. Mansour, Words restricted by 3-letter ..., arXiv:math/0112281 [math.CO], 2001.
A. Burstein and T. Mansour, Words Restricted by 3-Letter Generalized Multipermutation Patterns, Annals. Combin., 7 (2003), 1-14.
Martin Burtscher, Igor Szczyrba, Rafał Szczyrba, Analytic Representations of the n-anacci Constants and Generalizations Thereof, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.5.
Index entries for linear recurrences with constant coefficients, signature (5,5).

Column 6 in A265584.

a:=[6,36];; for n in [3..30] do a[n]:=5*(a[n-1]+a[n-2]); od; Concatenation([1], a); # G. C. Greubel, Aug 07 2019

I:=[6,36]; [1] cat [n le 2 select I[n] else 5*(Self(n-1)+ Self(n-2)): n in [1..30]]; // G. C. Greubel, Aug 07 2019

seq(coeff(series((1+x+x^2)/(1-5*x-5*x^2), x, n+1), x, n), n = 0..30); # G. C. Greubel, Aug 07 2019

CoefficientList[Series[(1+x+x^2)/(1-5x-5x^2),{x,0,30}],x] (* or *) LinearRecurrence[{5,5},{1,6,36}, 40] (* Harvey P. Dale, Jan 03 2019 *)

my(x='x+O('x^30)); Vec((1+x+x^2)/(1-5*x-5*x^2)) \\ G. C. Greubel, Aug 07 2019

def A123887_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( (1+x+x^2)/(1-5*x-5*x^2) ).list()
A123887_list(30) # G. C. Greubel, Aug 07 2019

a(0)=1, a(1)=6, a(2)=36, a(n) = 5*a(n-1) + 5*a(n-2) for n>2. - Philippe Deléham, Sep 19 2009

cp's OEIS Frontend

A006355 Number of binary vectors of length n containing no singletons.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

SageMath

Formula

Extensions

A121907 Expansion of g.f.: (1 + x + x^2)/(1 - 2*x - 2*x^2).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A265583 Array T(n,k) = k*(k-1)^(n-1) read by ascending antidiagonals; k,n >= 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A265624 Array T(n,k): The number of words of length n in an alphabet of size k which do not contain 4 consecutive letters.

Views

Author

Keywords

Examples

Crossrefs

Programs

Maple

Formula

A123871 Expansion of g.f.: (1+x+x^2)/(1-4*x-4*x^2).

Views

Author

Keywords

Links

Crossrefs

Programs

A121907 Expansion of g.f.: (1 + x + x^2)/(1 - 2x - 2x^2).

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

A123871 Expansion of g.f.: (1+x+x^2)/(1-4x-4x^2).

A123887 Expansion of g.f.: (1+x+x^2)/(1-5x-5x^2).