A015442 -id:A015442 - cp's OEIS frontend

A176264 Triangle T(n,k) = A015442(k) - A015442(n) + A015442(n-k) read by rows.

1, 1, 1, 1, -6, 1, 1, -6, -6, 1, 1, -55, -55, -55, 1, 1, -104, -153, -153, -104, 1, 1, -496, -594, -643, -594, -496, 1, 1, -1231, -1721, -1819, -1819, -1721, -1231, 1, 1, -4710, -5935, -6425, -6474, -6425, -5935, -4710, 1, 1, -13334, -18038, -19263, -19704, -19704, -19263, -18038, -13334, 1

Offset: 0

Roger L. Bagula, Apr 13 2010

Row sums are s(n) = {1, 2, -4, -10, -163, -512, -2821, -9540, -40612, -140676, -537533, ...} where s(n) = 3*s(n-1) +11*s(n-2) -27*s(n-3) -35*s(n-4) +49*s(n-5) with g.f. (1-x-21*x^2+7*x^3)/((1-x)*(1-x-7*x^2)^2).

			Triangle begins as:
  1;
  1,      1;
  1,     -6,      1;
  1,     -6,     -6,      1;
  1,    -55,    -55,    -55,      1;
  1,   -104,   -153,   -153,   -104,      1;
  1,   -496,   -594,   -643,   -594,   -496,      1;
  1,  -1231,  -1721,  -1819,  -1819,  -1721,  -1231,      1;
  1,  -4710,  -5935,  -6425,  -6474,  -6425,  -5935,  -4710,      1;
  1, -13334, -18038, -19263, -19704, -19704, -19263, -18038, -13334,      1;
  1, -46311, -59639, -64343, -65519, -65911, -65519, -64343, -59639, -46311, 1;

G. C. Greubel, Rows n = 0..100 of triangle, flattened

A015442:= func< n | &+[7^j*Binomial(n-j,j): j in [0..Floor(n/2)]] >;
[A015442(k) - A015442(n) + A015442(n-k): k in [0..n], n in [0..10]]; // G. C. Greubel, Nov 24 2019

(* Set of sequences q=0..10. This sequence is q=7. *)
f[n_, q_]:= f[n, q] = If[n<2, n, f[n-1, q] + q*f[n-2, q]];
T[n_, k_, q_]:= f[k+1, q] + f[n-k+1, q] - f[n+1, q];
Table[Flatten[Table[T[n, k, q], {n,0,10}, {k,0,n}]], {q,0,10}]
(* Second program *)
A015442[n_]:= Sum[7^j*Binomial[n-j, j], {j,0,(n+1)/2}]; T[n_, k_]:= T[n, k]= A015442[k] +A015442[n-k] -A015442[n]; Table[T[n, k], {n, 0, 10}, {k, 0, n}]//Flatten (* G. C. Greubel, Nov 24 2019 *)

A015442(n) = sum(j=0,(n+1)\2, 7^j*binomial(n-j,j));
T(n,k) = A015442(k) - A015442(n) + A015442(n-k); \\ G. C. Greubel, Nov 24 2019

def A015442(n): return sum(7^j*binomial(n-j,j) for j in (0..floor(n/2)))
[[A015442(k) - A015442(n) + A015442(n-k) for k in (0..n)] for n in (0..10)] # G. C. Greubel, Nov 24 2019

T(n,k) = T(n,n-k).

A109466 Riordan array (1, x(1-x)).

Original entry on oeis.org

1, 0, 1, 0, -1, 1, 0, 0, -2, 1, 0, 0, 1, -3, 1, 0, 0, 0, 3, -4, 1, 0, 0, 0, -1, 6, -5, 1, 0, 0, 0, 0, -4, 10, -6, 1, 0, 0, 0, 0, 1, -10, 15, -7, 1, 0, 0, 0, 0, 0, 5, -20, 21, -8, 1, 0, 0, 0, 0, 0, -1, 15, -35, 28, -9, 1, 0, 0, 0, 0, 0, 0, -6, 35, -56, 36, -10, 1, 0, 0, 0, 0, 0, 0, 1, -21, 70, -84, 45, -11, 1, 0, 0, 0, 0

Offset: 0

Philippe Deléham, Aug 28 2005

Inverse is Riordan array (1, xc(x)) (A106566).
Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, -1, 1, 0, 0, 0, 0, 0, 0, ...] DELTA [1, 0, 0, 0, 0, 0, 0, 0, ...] where DELTA is the operator defined in A084938.
Modulo 2, this sequence gives A106344. - Philippe Deléham, Dec 18 2008
Coefficient array of the polynomials Chebyshev_U(n, sqrt(x)/2)*(sqrt(x))^n. - Paul Barry, Sep 28 2009

			Rows begin:
  1;
  0,  1;
  0, -1,  1;
  0,  0, -2,  1;
  0,  0,  1, -3,  1;
  0,  0,  0,  3, -4,   1;
  0,  0,  0, -1,  6,  -5,   1;
  0,  0,  0,  0, -4,  10,  -6,   1;
  0,  0,  0,  0,  1, -10,  15,  -7,  1;
  0,  0,  0,  0,  0,   5, -20,  21, -8,  1;
  0,  0,  0,  0,  0,  -1,  15, -35, 28, -9, 1;
From _Paul Barry_, Sep 28 2009: (Start)
Production array is
  0,    1,
  0,   -1,    1,
  0,   -1,   -1,   1,
  0,   -2,   -1,  -1,   1,
  0,   -5,   -2,  -1,  -1,  1,
  0,  -14,   -5,  -2,  -1, -1,  1,
  0,  -42,  -14,  -5,  -2, -1, -1,  1,
  0, -132,  -42, -14,  -5, -2, -1, -1,  1,
  0, -429, -132, -42, -14, -5, -2, -1, -1, 1 (End)

Paul Barry, Embedding structures associated with Riordan arrays and moment matrices, arXiv preprint arXiv:1312.0583 [math.CO], 2013.
Tom Copeland, Addendum to Elliptic Lie Triad

Cf. A026729 (unsigned version), A000108, A030528, A124644.

/* As triangle */ [[(-1)^(n-k)*Binomial(k, n-k): k in [0..n]]: n in [0.. 15]]; // Vincenzo Librandi, Jan 14 2016

(* The function RiordanArray is defined in A256893. *)
RiordanArray[1&, #(1-#)&, 13] // Flatten (* Jean-François Alcover, Jul 16 2019 *)

Number triangle T(n, k) = (-1)^(n-k)*binomial(k, n-k).
T(n, k)*2^(n-k) = A110509(n, k); T(n, k)*3^(n-k) = A110517(n, k).
Sum_{k=0..n} T(n,k)*A000108(k)=1. - Philippe Deléham, Jun 11 2007
From Philippe Deléham, Oct 30 2008: (Start)
Sum_{k=0..n} T(n,k)*A144706(k) = A082505(n+1).
Sum_{k=0..n} T(n,k)*A002450(k) = A100335(n).
Sum_{k=0..n} T(n,k)*A001906(k) = A100334(n).
Sum_{k=0..n} T(n,k)*A015565(k) = A099322(n).
Sum_{k=0..n} T(n,k)*A003462(k) = A106233(n). (End)
Sum_{k=0..n} T(n,k)*x^(n-k) = A053404(n), A015447(n), A015446(n), A015445(n), A015443(n), A015442(n), A015441(n), A015440(n), A006131(n), A006130(n), A001045(n+1), A000045(n+1), A000012(n), A010892(n), A107920(n+1), A106852(n), A106853(n), A106854(n), A145934(n), A145976(n), A145978(n), A146078(n), A146080(n), A146083(n), A146084(n) for x = -12,-11,-10,-9,-8,-7,-6,-5,-4,-3,-2,-1,0,1,2,3,4,5,6,7,8,9,10,11,12 respectively. - Philippe Deléham, Oct 27 2008
Sum_{k=0..n} T(n,k)*x^k = A000007(n), A010892(n), A099087(n), A057083(n), A001787(n+1), A030191(n), A030192(n), A030240(n), A057084(n), A057085(n+1), A057086(n) for x = 0,1,2,3,4,5,6,7,8,9,10 respectively. - Philippe Deléham, Oct 28 2008
G.f.: 1/(1-y*x+y*x^2). - Philippe Deléham, Dec 15 2011
T(n,k) = T(n-1,k-1) - T(n-2,k-1), T(n,0) = 0^n. - Philippe Deléham, Feb 15 2012
Sum_{k=0..n} T(n,k)*x^(n-k) = F(n+1,-x) where F(n,x)is the n-th Fibonacci polynomial in x defined in A011973. - Philippe Deléham, Feb 22 2013
Sum_{k=0..n} T(n,k)^2 = A051286(n). - Philippe Deléham, Feb 26 2013
Sum_{k=0..n} T(n,k)*T(n+1,k) = -A110320(n). - Philippe Deléham, Feb 26 2013
For T(0,0) = 0, the signed triangle below has the o.g.f. G(x,t) = [t*x(1-x)]/[1-t*x(1-x)] = L[t*Cinv(x)] where L(x) = x/(1-x) and Cinv(x)=x(1-x) with the inverses Linv(x) = x/(1+x) and C(x)= [1-sqrt(1-4*x)]/2, an o.g.f. for the shifted Catalan numbers A000108, so the inverse o.g.f. is Ginv(x,t) = C[Linv(x)/t] = [1-sqrt[1-4*x/(t(1+x))]]/2 (cf. A124644 and A030528). - Tom Copeland, Jan 19 2016

A015443 Generalized Fibonacci numbers: a(n) = a(n-1) + 8*a(n-2).

Original entry on oeis.org

1, 1, 9, 17, 89, 225, 937, 2737, 10233, 32129, 113993, 371025, 1282969, 4251169, 14514921, 48524273, 164643641, 552837825, 1869986953, 6292689553, 21252585177, 71594101601, 241614783017, 814367595825, 2747285859961

Offset: 0

Olivier Gérard

Construct a graph as follows: form the graph whose adjacency matrix is the tensor product of that of P_3 and [1,1;1,1], then add a loop at each of the extremity nodes. a(n-1) counts walks of length n between adjacent nodes. - Paul Barry, Nov 12 2004
The compositions of n in which each natural number is colored by one of p different colors are called p-colored compositions of n. For n >= 2, 9*a(n-2) equals the number of 9-colored compositions of n with all parts >= 2, such that no adjacent parts have the same color. - Milan Janjic, Nov 26 2011
Pisano period lengths: 1, 1, 6, 1, 24, 6, 16, 1, 6, 24, 110, 6, 56, 16, 24, 2, 16, 6, 60, 24, ... - R. J. Mathar, Aug 10 2012

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Joerg Arndt, Matters Computational (The Fxtbook), p. 318
Milan Janjic, On Linear Recurrence Equations Arising from Compositions of Positive Integers, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.7.
Index entries for linear recurrences with constant coefficients, signature (1,8)

Cf. A015442, A015441, A100302, A100303.

[ n eq 1 select 1 else n eq 2 select 1 else Self(n-1)+8*Self(n-2): n in [1..30] ]; // Vincenzo Librandi, Aug 23 2011

CoefficientList[Series[1/(1-x-8*x^2), {x,0,50}], x] (* G. C. Greubel, Apr 30 2017 *)

Vec(1/(1-x-8*x^2)+O(x^99)) \\ Charles R Greathouse IV, Feb 03 2014

[lucas_number1(n,1,-8) for n in range(1, 27)] # Zerinvary Lajos, Apr 22 2009

a(n) = (((1+sqrt(33))/2)^(n+1) - ((1-sqrt(33))/2)^(n+1))/sqrt(33).
a(n) = Sum_{k=0..n} A109466(n,k)*(-8)^(n-k). - Philippe Deléham, Oct 26 2008
G.f.: 1/(1-x-8*x^2). - R. J. Mathar, Apr 07 2011
a(n) = (Sum_{1<=k<=n+1, k odd} C(n+1,k)*33^((k-1)/2))/2^n. - Vladimir Shevelev, Feb 05 2014

A015445 Generalized Fibonacci numbers: a(n) = a(n-1) + 9*a(n-2).

Original entry on oeis.org

1, 1, 10, 19, 109, 280, 1261, 3781, 15130, 49159, 185329, 627760, 2295721, 7945561, 28607050, 100117099, 357580549, 1258634440, 4476859381, 15804569341, 56096303770, 198337427839, 703204161769, 2488241012320, 8817078468241, 31211247579121, 110564953793290

Offset: 0

Olivier Gérard

The compositions of n in which each natural number is colored by one of p different colors are called p-colored compositions of n. For n >= 2, 10*a(n-2) equals the number of 10-colored compositions of n with all parts >= 2, such that no adjacent parts have the same color. - Milan Janjic, Nov 26 2011

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
J. Borowska, L. Lacinska, Recurrence form of determinant of a heptadiagonal symmetric Toeplitz matrix, J. Appl. Math. Comp. Mech. 13 (2014) 19-16, remark 2 for permanent of tridiagonal Toeplitz matrices a=1, b=3.
Index entries for linear recurrences with constant coefficients, signature (1,9).

Cf. A015443, A015442, A026595, A128099.

[ n eq 1 select 1 else n eq 2 select 1 else Self(n-1)+9*Self(n-2): n in [1..30] ]; // Vincenzo Librandi, Aug 23 2011

m:=25; S:=series(1/(1-x-9*x^2), x, m+1): seq(coeff(S, x, j), j=0..m); # G. C. Greubel, Feb 18 2020

CoefficientList[Series[1/(1-x-9*x^2), {x,0,25}], x] (* or *) LinearRecurrence[{1,9}, {1,1}, 25] (* G. C. Greubel, Apr 30 2017 *)

a(n)=([0,1; 9,1]^n*[1;1])[1,1] \\ Charles R Greathouse IV, Oct 03 2016

[lucas_number1(n,1,-9) for n in range(1, 25)] # Zerinvary Lajos, Apr 22 2009

a(n) = (((1+sqrt(37))/2)^(n+1) - ((1-sqrt(37))/2)^(n+1))/sqrt(37).
a(n) = Sum_{k=0..floor(n/2)} binomial(n-k, k)*9^k. - Paul Barry, Jul 20 2004
a(n) = Sum_{k=0..n} binomial((n+k)/2, (n-k)/2)*(1+(-1)^(n-k))*3^(n-k)/2. - Paul Barry, Aug 28 2005
a(n) = Sum_{k=0..n} A109466(n,k)*(-9)^(n-k). - Philippe Deléham, Oct 26 2008
a(n) = (-703*(1/2-sqrt(37)/2)^n + 199*sqrt(37)*(1/2-sqrt(37)/2)^n-333*(1/2+sqrt(37)/2)^n + 171*sqrt(37)*(1/2+sqrt(37)/2)^n)/(74*(5*sqrt(37)-14)). - Alexander R. Povolotsky, Oct 13 2010
a(n) = Sum_{k=1..n+1, k odd} C(n+1,k)*37^((k-1)/2)/2^n. - Vladimir Shevelev, Feb 05 2014
G.f.: 1/(1-x-9*x^2). - Philippe Deléham, Feb 19 2020
a(n) = J(n, 9/2), where J(n,x) are the Jacobsthal polynomials. - G. C. Greubel, Feb 18 2020
E.g.f.: exp(x/2)*(sqrt(37)*cosh(sqrt(37)*x/2) + sinh(sqrt(37)*x/2))/sqrt(37). - Stefano Spezia, Feb 19 2020

Edited by N. J. A. Sloane, Oct 11 2010

A111006 Another version of Fibonacci-Pascal triangle A037027.

Original entry on oeis.org

1, 0, 1, 0, 1, 2, 0, 0, 2, 3, 0, 0, 1, 5, 5, 0, 0, 0, 3, 10, 8, 0, 0, 0, 1, 9, 20, 13, 0, 0, 0, 0, 4, 22, 38, 21, 0, 0, 0, 0, 1, 14, 51, 71, 34, 0, 0, 0, 0, 0, 5, 40, 111, 130, 55, 0, 0, 0, 0, 0, 1, 20, 105, 233, 235, 89, 0, 0, 0, 0, 0, 0, 6, 65, 256, 474, 420, 144

Offset: 0

Philippe Deléham, Oct 02 2005

Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, 1, -1, 0, 0, 0, 0, 0, 0, 0, ...] DELTA [1, 1, -1, 0, 0, 0, 0, 0, 0, ...] where DELTA is the operator defined in A084938.
Row sums are the Jacobsthal numbers A001045(n+1) and column sums form Pell numbers A000129.
Maximal column entries: A038149 = {1, 1, 2, 5, 10, 22, ...}.
T(n,k) gives a convolved Fibonacci sequence (A001629, A001872, ...).
Triangle read by rows: T(n,n-k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2)). - Philippe Deléham, Feb 17 2014
Diagonal sums are A013979(n). - Philippe Deléham, Feb 17 2014
T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and 1 X 2 tiles. - Emeric Deutsch, Aug 14 2014

			Triangle begins:
  1;
  0, 1;
  0, 1, 2;
  0, 0, 2, 3;
  0, 0, 1, 5,  5;
  0, 0, 0, 3, 10,  8;
  0, 0, 0, 1,  9, 20, 13;
  0, 0, 0, 0,  4, 22, 38,  21;
  0, 0, 0, 0,  1, 14, 51,  71,  34;
  0, 0, 0, 0,  0,  5, 40, 111, 130,  55;
  0, 0, 0, 0,  0,  1, 20, 105, 233, 235,  89;
  0, 0, 0, 0,  0,  0,  6,  65, 256, 474, 420, 144;

Reinhard Zumkeller, Rows n = 0..120 of table, flattened
Index entries for triangles and arrays related to Pascal's triangle

Cf. A000045, A000129, A001045, A037027, A038112, A038149, A084938, A128100 (reversed version).

Some other Fibonacci-Pascal triangles: A027926, A036355, A037027, A074829, A105809, A109906, A114197, A162741, A228074.

a111006 n k = a111006_tabl !! n !! k
a111006_row n = a111006_tabl !! n
a111006_tabl =  map fst $ iterate (\(us, vs) ->
   (vs, zipWith (+) (zipWith (+) ([0] ++ us ++ [0]) ([0,0] ++ us))
                    ([0] ++ vs))) ([1], [0,1])
-- Reinhard Zumkeller, Aug 15 2013

T(0, 0) = 1, T(n, k) = 0 for k < 0 or for n < k, T(n, k) = T(n-1, k-1) + T(n-2, k-1) + T(n-2, k-2).
T(n, k) = A037027(k, n-k). T(n, n) = A000045(n+1). T(3n, 2n) = (n+1)*A001002(n+1) = A038112(n).
G.f.: 1/(1-yx(1-x)-x^2*y^2). - Paul Barry, Oct 04 2005
Sum_{k=0..n} x^k*T(n,k) = (-1)^n*A053524(n+1), (-1)^n*A083858(n+1), (-1)^n*A002605(n), A033999(n), A000007(n), A001045(n+1), A083099(n) for x = -4, -3, -2, -1, 0, 1, 2 respectively. - Philippe Deléham, Dec 02 2006
Sum_{k=0..n} T(n,k)*x^(n-k) = A053404(n), A015447(n), A015446(n), A015445(n), A015443(n), A015442(n), A015441(n), A015440(n), A006131(n), A006130(n), A001045(n+1), A000045(n+1) for x = 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 respectively. - Philippe Deléham, Feb 17 2014

A083856 Square array T(n,k) of generalized Fibonacci numbers, read by antidiagonals upwards (n, k >= 0).

Original entry on oeis.org

0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 1, 3, 3, 1, 0, 1, 1, 4, 5, 5, 1, 0, 1, 1, 5, 7, 11, 8, 1, 0, 1, 1, 6, 9, 19, 21, 13, 1, 0, 1, 1, 7, 11, 29, 40, 43, 21, 1, 0, 1, 1, 8, 13, 41, 65, 97, 85, 34, 1, 0, 1, 1, 9, 15, 55, 96, 181, 217, 171, 55, 1

Offset: 0

Paul Barry, May 06 2003

Row n >= 0 of the array gives the solution to the recurrence b(k) = b(k-1) + n*b(k-2) for k >= 2 with b(0) = 0 and b(1) = 1.

			Array T(n,k) (with rows n >= 0 and columns k >= 0) begins as follows:
  0, 1, 1,  1,  1,   1,   1,    1,    1,     1, ... [A057427]
  0, 1, 1,  2,  3,   5,   8,   13,   21,    34, ... [A000045]
  0, 1, 1,  3,  5,  11,  21,   43,   85,   171, ... [A001045]
  0, 1, 1,  4,  7,  19,  40,   97,  217,   508, ... [A006130]
  0, 1, 1,  5,  9,  29,  65,  181,  441,  1165, ... [A006131]
  0, 1, 1,  6, 11,  41,  96,  301,  781,  2286, ... [A015440]
  0, 1, 1,  7, 13,  55, 133,  463, 1261,  4039, ... [A015441]
  0, 1, 1,  8, 15,  71, 176,  673, 1905,  6616, ... [A015442]
  0, 1, 1,  9, 17,  89, 225,  937, 2737, 10233, ... [A015443]
  0, 1, 1, 10, 19, 109, 280, 1261, 3781, 15130, ... [A015445]
  ...

A. G. Shannon and J. V. Leyendekkers, The Golden Ratio family and the Binet equation, Notes on Number Theory and Discrete Mathematics, 21(2) (2015), 35-42.

Rows include A057427 (n=0), A000045 (n=1), A001045 (n=2), A006130 (n=3), A006131 (n=4), A015440 (n=5), A015441 (n=6), A015442 (n=7), A015443 (n=8), A015445 (n=9).
Columns include A000012 (k=1,2), A000027 (k=3), A005408 (k=4), A028387 (k=5), A000567 (k=6), A106734 (k=7).
Cf. A083857 (binomial transform), A083859 (main diagonal), A083860 (first subdiagonal), A083861 (second binomial transform), A110112, A110113 (diagonal sums), A193376 (transposed variant), A172237 (transposed variant).

function generalized_fibonacci(r, n)
   F = BigInt[1 r; 1 0]
   Fn = F^n
   Fn[2, 1]
end
for r in 0:6 println([generalized_fibonacci(r, n) for n in 0:9]) end # Peter Luschny, Mar 06 2017

A083856_row := proc(r, n) local R; R := proc(n) option remember;
if n<=1 then n else R(n-1)+r*R(n-2) fi end: R(n) end:
for r from 0 to 9 do seq(A083856_row(r, n), n=0..9) od; # Peter Luschny, Mar 06 2017

T[, 0] = 0; T[, 1|2] = 1; T[n_, k_] := T[n, k] = T[n, k-1] + n T[n, k-2];
Table[T[n-k, k], {n, 0, 11}, {k, 0, n}] // Flatten (* Jean-François Alcover, Jun 22 2018 *)

T(n, k) = (((1 + sqrt(4*n + 1))/2)^k - ((1 - sqrt(4*n + 1))/2)^k)/sqrt(4*n + 1). [corrected by Michel Marcus, Jun 25 2018]
From Thomas Baruchel, Jun 25 2018: (Start)
The g.f. for row n >= 0 is x/(1 - x - n*x^2).
The g.f. for column k >= 1 is g(k,x) = 1/(1-x) + Sum_{m = 1..floor((k-1)/2)} (1 - x)^(-1 - m) * binomial(k - 1 - m, m) * Sum_{i = 0..m} x^i * Sum_{j = 0..i} (-1)^j * (i - j)^m * binomial(1 + m, j).
The g.f. for column k >= 1 is also g(k,x) = 1 + Sum_{m = 1..floor((k+1)/2)} ((1 - x)^(-m) * binomial(k-m, m-1) * Sum_{j = 0..m} (-1)^j * binomial(m, j) *  x^m * Phi(x, -m+1, -j+m)) + Sum_{s = 0..floor((k-1)/2)} binomial(k-s-1, s) * PolyLog(-s, x), where Phi is the Lerch transcendent function. (End)
T(n,k) = Sum_{i = 0..k} (-1)^(k+i) * binomial(k,i) * A083857(n,i). - Petros Hadjicostas, Dec 24 2019

Various sections edited by Petros Hadjicostas, Dec 24 2019

A223140 Decimal expansion of (sqrt(29) + 1)/2.

Original entry on oeis.org

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

Offset: 1

Jaroslav Krizek, Apr 02 2013

Decimal expansion of sqrt(7 + sqrt(7 + sqrt(7 + sqrt(7 + ... )))).
Sequence with a(1) = 2 is decimal expansion of sqrt(7 - sqrt(7 - sqrt(7 - sqrt(7 - ... )))) - A223141.
From Wolfdieter Lang, Jan 05 2024: (Start)
This number phi29 = (1 + sqrt(29))/2 is the fundamental algebraic integer in the quadratic number field Q(sqrt(29)) with minimal polynomial x^2 - x - 7. The other root is -A223141.
phi29^n = 7*A(n-1) + A(n)*phi29, where A(n) = A015442(n) with A(-1) = 1/7, for n >= 0. For negative powers n see A367454 = 1/phi29. (End)

			3.1925824035672520156253552457701...

Index entries for algebraic numbers, degree 2.

Cf. A223141, A367454.

Essentially the same as A098318 and A085551.

Mathematica
```
RealDigits[(1 + Sqrt[29])/2, 10, 130]
```

(sqrt(29)+1)/2 \\ Charles R Greathouse IV, Feb 10 2025

Closed form: (sqrt(29) + 1)/2 = A098318-2 = 10*A085551+3 = A223141+1.

sqrt(7 + sqrt(7 + sqrt(7 + sqrt(7 + ... )))) - 1 = sqrt(7 - sqrt(7 - sqrt(7 - sqrt(7 - ... )))). See A223141.

A193376 T(n,k) = number of ways to place any number of 2 X 1 tiles of k distinguishable colors into an n X 1 grid; array read by descending antidiagonals, with n, k >= 1.

Original entry on oeis.org

1, 1, 2, 1, 3, 3, 1, 4, 5, 5, 1, 5, 7, 11, 8, 1, 6, 9, 19, 21, 13, 1, 7, 11, 29, 40, 43, 21, 1, 8, 13, 41, 65, 97, 85, 34, 1, 9, 15, 55, 96, 181, 217, 171, 55, 1, 10, 17, 71, 133, 301, 441, 508, 341, 89, 1, 11, 19, 89, 176, 463, 781, 1165, 1159, 683, 144, 1, 12, 21, 109, 225, 673

Offset: 1

R. H. Hardin, Jul 24 2011

Transposed variant of A083856. - R. J. Mathar, Aug 23 2011

As to the sequences by columns beginning (1, N, ...), let m = (N-1). The g.f. for the sequence (1, N, ...) is 1/(1 - x - m*x^2). Alternatively, the corresponding matrix generator is [[1,1], [m,0]]. Another equivalency is simply: The sequence beginning (1, N, ...) is the INVERT transform of (1, m, 0, 0, 0, ...). Convergents to the sequences a(n)/a(n-1) are (1 + sqrt(4*m+1))/2. - Gary W. Adamson, Feb 25 2014

			Array T(n,k) (with rows n >= 1 and column k >= 1) begins as follows:
  ..1...1....1....1.....1.....1.....1......1......1......1......1......1...
  ..2...3....4....5.....6.....7.....8......9.....10.....11.....12.....13...
  ..3...5....7....9....11....13....15.....17.....19.....21.....23.....25...
  ..5..11...19...29....41....55....71.....89....109....131....155....181...
  ..8..21...40...65....96...133...176....225....280....341....408....481...
  .13..43...97..181...301...463...673....937...1261...1651...2113...2653...
  .21..85..217..441...781..1261..1905...2737...3781...5061...6601...8425...
  .34.171..508.1165..2286..4039..6616..10233..15130..21571..29844..40261...
  .55.341.1159.2929..6191.11605.19951..32129..49159..72181.102455.141361...
  .89.683.2683.7589.17621.35839.66263.113993.185329.287891.430739.624493...
  ...
Some solutions for n = 5 and k = 3 with colors = 1, 2, 3 and empty = 0:
..0....2....3....2....0....1....0....0....2....0....0....2....3....0....0....0
..0....2....3....2....2....1....2....3....2....1....0....2....3....1....1....1
..1....0....0....0....2....0....2....3....2....1....0....1....0....1....1....1
..1....2....2....0....3....2....2....3....2....0....3....1....3....3....2....1
..0....2....2....0....3....2....2....3....0....0....3....0....3....3....2....1

R. H. Hardin, Table of n, a(n) for n = 1..9999
Ron H. Hardin, Re: A193376 Tabl = 20 existing sequences, Sequence Fans mailing list, 2011.
Robert Israel, Re: A193376 Tabl = 20 existing sequences, Sequence Fans mailing list, 2011.

Column 1 is A000045(n+1), column 2 is A001045(n+1), column 3 is A006130, column 4 is A006131, column 5 is A015440, column 6 is A015441(n+1), column 7 is A015442(n+1), column 8 is A015443, column 9 is A015445, column 10 is A015446, column 11 is A015447, and column 12 is A053404,
Row 2 is A000027(n+1), row 3 is A004273(n+1), row 4 is A028387, row 5 is A000567(n+1), and row 6 is A106734(n+2).
Diagonal is A171180, superdiagonal 1 is A083859(n+1), and superdiagonal 2 is A083860(n+1).

T:= proc(n,k) option remember; `if`(n<0, 0,
      `if`(n<2 or k=0, 1, k*T(n-2, k) +T(n-1, k)))
    end;
seq(seq(T(n, d+1-n), n=1..d), d=1..12); # Alois P. Heinz, Jul 29 2011

T[n_, k_] := T[n, k] = If[n < 0, 0, If[n < 2 || k == 0, 1, k*T[n-2, k]+T[n-1, k]]]; Table[Table[T[n, d+1-n], {n, 1, d}], {d, 1, 12}] // Flatten (* Jean-François Alcover, Mar 04 2014, after Alois P. Heinz *)

With z X 1 tiles of k colors on an n X 1 grid (with n >= z), either there is a tile (of any of the k colors) on the first spot, followed by any configuration on the remaining (n-z) X 1 grid, or the first spot is vacant, followed by any configuration on the remaining (n-1) X 1. Thus, T(n,k) = T(n-1,k) + k*T(n-z,k), with T(n,k) = 1 for n = 0, 1, ..., z-1.
The solution is T(n,k) = Sum_r r^(-n-1)/(1 + z*k*r^(z-1)), where the sum is over the roots r of the polynomial k*x^z + x - 1.
For z = 2, T(n,k) = ((2*k / (sqrt(1 + 4*k) - 1))^(n+1) - (-2*k/(sqrt(1 + 4*k) + 1))^(n+1)) / sqrt(1 + 4*k).
T(n,k) = Sum_{s=0..[n/2]} binomial(n-s,s) * k^s.
For z X 1 tiles, T(n,k,z) = Sum_{s = 0..[n/z]} binomial(n-(z-1)*s, s) * k^s. - R. H. Hardin, Jul 31 2011

Formula and proof from Robert Israel in the Sequence Fans mailing list.

A185903 T(n,k)=1/8 the number of nXk 0..7 arrays with every element equal to exactly one or two of its horizontal and vertical neighbors.

Original entry on oeis.org

0, 1, 1, 1, 15, 1, 8, 196, 196, 8, 15, 2765, 7854, 2765, 15, 71, 38731, 546280, 546280, 38731, 71, 176, 545328, 28967421, 139230658, 28967421, 545328, 176, 673, 7675381, 1748982326, 32611077940, 32611077940, 1748982326, 7675381, 673, 1905

Offset: 1

R. H. Hardin Feb 06 2011

Table starts
....0.........1...........1.............8.............15............71
....1........15.........196..........2765..........38731........545328
....1.......196........7854........546280.......28967421....1748982326
....8......2765......546280.....139230658....32611077940.7921723799549
...15.....38731....28967421...32611077940.30884279980274
...71....545328..1748982326.7921723799549
..176...7675381.98953708266
..673.108065699
.1905

			Some solutions for 4X3 with a(1,1)=0
..0..4..5....0..0..4....0..4..0....0..0..6....0..4..2....0..4..6....0..0..3
..0..4..5....4..4..4....0..4..0....4..4..6....0..4..2....0..4..6....4..0..3
..1..1..4....6..7..3....6..6..0....4..4..5....5..3..3....2..0..0....4..0..0
..1..1..4....6..7..3....5..5..0....3..3..5....5..5..5....2..5..5....4..4..4

Column 1 is A015442(n-1)

A189800 a(n) = 6a(n-1) + 8a(n-2), with a(0)=0, a(1)=1.

Original entry on oeis.org

0, 1, 6, 44, 312, 2224, 15840, 112832, 803712, 5724928, 40779264, 290475008, 2069084160, 14738305024, 104982503424, 747801460736, 5326668791808, 37942424436736, 270267896954880, 1925146777223168, 13713023838978048, 97679317251653632, 695780094221746176

Offset: 0

Vladimir Joseph Stephan Orlovsky, May 24 2011

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (6,8).

Sequences of the form a(n) = c*a(n-1) + d*a(n-2), with a(0)=0, a(1)=1:
c/d...1.......2.......3.......4.......5.......6.......7.......8.......9......10
.A000045,A001045,A006130,A006131,A015440,A015441,A015442,A015443,A015445,A015446
.A000129,A002605,A015518,A063727,A002532,A083099,A015519,A003683,A002534,A083102
.A006190,A007482,A030195,A015521,A015523,A083858,A015524,A015525,A099012,A015528
.A001076,A090017,A015530,A057087,A015531,A085939,A015532,A180222,A015533,A180226
.A052918,A015535,A015536,A015537,A057088,A015540,A015541,A015544,A015545,A180250
.A005668,A135030,A090018,A135032,A015551,A057089,A015552,A189800,A189801,A190005
.A054413,A015555,A015559,A015561,A015562,A015564,A057090,A015565,A015566,A015568
.A041025,A190331,A015574,A190510,A015575,A190560,A015576,A057091,A015577,A190953
.A099371,A015579,A181353,A015580,A015581,A153191,A015583,A015584,A057092,A015585
A041041,A191014,A015588,A190954,A190955,A190956,A015589,A190957,A015591,A057093

I:=[0,1]; [n le 2 select I[n] else 6*Self(n-1)+8*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 14 2011

LinearRecurrence[{6, 8}, {0, 1}, 50]
CoefficientList[Series[-(x/(-1+6 x+8 x^2)),{x,0,50}],x] (* Harvey P. Dale, Jul 26 2011 *)

a(n)=([0,1; 8,6]^n*[0;1])[1,1] \\ Charles R Greathouse IV, Oct 03 2016

G.f.: x/(1 - 2*x*(3+4*x)). - Harvey P. Dale, Jul 26 2011

cp's OEIS Frontend

A176264 Triangle T(n,k) = A015442(k) - A015442(n) + A015442(n-k) read by rows.

Views

Author

Keywords

Comments

Examples

Links

Programs

Magma

Mathematica

PARI

Sage

Formula

A109466 Riordan array (1, x(1-x)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

A015443 Generalized Fibonacci numbers: a(n) = a(n-1) + 8*a(n-2).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A015445 Generalized Fibonacci numbers: a(n) = a(n-1) + 9*a(n-2).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A111006 Another version of Fibonacci-Pascal triangle A037027.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Formula

A083856 Square array T(n,k) of generalized Fibonacci numbers, read by antidiagonals upwards (n, k >= 0).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Julia

Maple

Mathematica

Formula

Extensions

A223140 Decimal expansion of (sqrt(29) + 1)/2.

A189800 a(n) = 6a(n-1) + 8a(n-2), with a(0)=0, a(1)=1.