A075835 -id:A075835 - cp's OEIS frontend

A004190 Expansion of 1/(1 - 11*x + x^2).

1, 11, 120, 1309, 14279, 155760, 1699081, 18534131, 202176360, 2205405829, 24057287759, 262424759520, 2862615066961, 31226340977051, 340627135680600, 3715672151509549, 40531766530924439, 442133759688659280, 4822939590044327641, 52610201730798944771, 573889279448744064840

Offset: 0

N. J. A. Sloane

Chebyshev or generalized Fibonacci sequence.
This is the m=13 member of the m-family of sequences S(n,m-2) = S(2*n+1,sqrt(m))/sqrt(m). The m=4..12 (nonnegative) sequences are A000027, A001906, A001353, A004254, A001109, A004187, A001090, A018913 and A004189. The m=1..3 (signed) sequences are A049347, A056594, A010892.
All positive integer solutions of Pell equation b(n)^2 - 117*a(n)^2 = +4 together with b(n+1)=A057076(n+1), n >= 0. - Wolfdieter Lang, Aug 31 2004
For positive n, a(n) equals the permanent of the tridiagonal matrix of order n with 11's along the main diagonal, and i's along the superdiagonal and the subdiagonal (i is the imaginary unit). - John M. Campbell, Jul 08 2011
a(n) equals the number of 01-avoiding words of length n-1 on alphabet {0,1,...,10}. - Milan Janjic, Jan 25 2015
17*a(n+1) + 4*(a(n) + (-1)^n) is 13 times the numerator of the continued fraction [3,3,...,3,1,3,...,3,3] with n+1 3's on either side of the central 1. For example, when n=2 the continued fraction [3,3,3,1,3,3,3] = 1749/529, and 17*a(3) + 4(a(2)+1) = 17*1309 + 4*121 = 22737 = 13*1749. - Greg Dresden and Tulipa Wray, Aug 26 2025

			G.f. = 1 + 11*x + 120*x^2 + 1309*x^3 + 14279*x^4 + 155760*x^5 + ...

Vincenzo Librandi, Table of n, a(n) for n = 0..900
K. Andersen, L. Carbone, and D. Penta, Kac-Moody Fibonacci sequences, hyperbolic golden ratios, and real quadratic fields, Journal of Number Theory and Combinatorics, Vol 2, No. 3 pp 245-278, 2011. See Section 9.
Hacène Belbachir, Soumeya Merwa Tebtoub, and László Németh, Ellipse Chains and Associated Sequences, J. Int. Seq., Vol. 23 (2020), Article 20.8.5.
D. Birmajer, J. B. Gil, and M. D. Weiner, On the Enumeration of Restricted Words over a Finite Alphabet, J. Int. Seq. 19 (2016) # 16.1.3, example 12
Sergio Falcon, Generalized Fibonacci Sequences Generated from a k-Fibonacci Sequence, Journal of Mathematics Research Vol. 4, No. 2; April 2012. - From _N. J. A. Sloane_, Sep 22 2012
R. Flórez, R. A. Higuita, and A. Mukherjee, Alternating Sums in the Hosoya Polynomial Triangle, Article 14.9.5 Journal of Integer Sequences, Vol. 17 (2014).
A. F. Horadam, Special properties of the sequence W_n(a,b; p,q), Fib. Quart., 5.5 (1967), 424-434. Case a=0,b=1; p=11, q=-1.
Milan Janjic, On Linear Recurrence Equations Arising from Compositions of Positive Integers, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.7.
Tanya Khovanova, Recursive Sequences
Wolfdieter Lang, On polynomials related to powers of the generating function of Catalan's numbers, Fib. Quart. 38 (2000) 408-419. Eq.(44), lhs, m=13.
Index entries for sequences related to Chebyshev polynomials..
Index entries for linear recurrences with constant coefficients, signature (11,-1).

Cf. A000027, A001090, A001109, A001353, A001906, A004187, A004189, A004254, A006190, A010892, A018913, A049310, A049347, A056594, A057076, A075835, A101950.

with(combinat):seq(fibonacci(2*n+2, 3)/3, n=0..20); # Zerinvary Lajos, Apr 20 2008

Join[{a=1,b=11},Table[c=11*b-a; a=b; b=c, {n,60}]] (* Vladimir Joseph Stephan Orlovsky, Jan 20 2011 *)
CoefficientList[Series[1/(1-11*x+x^2),{x,0,30}],x] (* Vincenzo Librandi, Jun 13 2012 *)
Table[Fibonacci[2n + 2, 3]/3, {n, 0, 20}] (* Vladimir Reshetnikov, Sep 16 2016 *)
a[ n_] := ChebyshevU[n, 11/2]; (* Michael Somos, Jul 14 2018 *)

Vec(1/(1-11*x+x^2)+O(x^99)) \\ Charles R Greathouse IV, Sep 23 2012

{a(n) = polchebyshev(n, 2, 11/2)}; /* Michael Somos, Jul 14 2018 */

[lucas_number1(n,11,1) for n in range(1, 20)] # Zerinvary Lajos, Jun 25 2008

Recursion: a(n) = 11*a(n-1) - a(n-2), n >= 1; a(-1)=0, a(0)=1.
a(n) = S(2*n+1, sqrt(13))/sqrt(13) = S(n, 11); S(n, x) := U(n, x/2), Chebyshev polynomials of 2nd kind, A049310.
G.f.: 1/(1 - 11*x + x^2).
a(n) = ((11+3*sqrt(13))^(n+1) - (11-3*sqrt(13))^(n+1))/(2^(n+1)*3*sqrt(13)). - Rolf Pleisch, May 22 2011
a(n) = Sum_{k=0..n} A101950(n,k)*10^k. - Philippe Deléham, Feb 10 2012
From Peter Bala, Dec 23 2012: (Start)
Product_{n>=0} (1 + 1/a(n)) = 1/3*(3 + sqrt(13)).
Product_{n>=1} (1 - 1/a(n)) = 3/22*(3 + sqrt(13)). (End)
a(n) = sqrt((A057076(n+1)^2 - 4)/117).
a(n) = A075835(n+1)/3 = A006190(2*n+2)/3. - Vladimir Reshetnikov, Sep 16 2016
a(n) = -a(-2-n) for all n in Z. - Michael Somos, Jul 14 2018
E.g.f.: exp(11*x/2)*(39*cosh(3*sqrt(13)*x/2) + 11*sqrt(13)*sinh(3*sqrt(13)*x/2))/39. - Stefano Spezia, Aug 07 2024

Wolfdieter Lang, Oct 31 2002

A378908 Square array, read by descending antidiagonals, where each row n comprises the integers w >= 1 such that A000037(n)*w^2+4 is a square.

Original entry on oeis.org

4, 24, 2, 140, 8, 1, 816, 30, 3, 4, 4756, 112, 8, 40, 6, 27720, 418, 21, 396, 96, 2, 161564, 1560, 55, 3920, 1530, 12, 12, 941664, 5822, 144, 38804, 24384, 70, 456, 6, 5488420, 21728, 377, 384120, 388614, 408, 17316, 120, 1, 31988856, 81090, 987, 3802396

Offset: 1

Charles L. Hohn, Dec 10 2024

Also, integers w >= 1 for each row n >= 1 such that z+(1/z) is an integer, where x = A000037(n), y = w*sqrt(x), and z = (y+ceiling(y))/2.
All terms of row n are positive integer multiples of T(n, 1).
Limit_{k->oo} T(n, k+1)/T(n, k) = (sqrt(b^2-4)+b)/2 where b=T(n, 2)/T(n, 1).

			n=row index; x=nonsquare integer of index n (A000037(n)):
 n  x    T(n, k)
------+---------------------------------------------------------------------
 1  2 |  4,   24,   140,     816,      4756,       27720,        161564, ...
 2  3 |  2,    8,    30,     112,       418,        1560,          5822, ...
 3  5 |  1,    3,     8,      21,        55,         144,           377, ...
 4  6 |  4,   40,   396,    3920,     38804,      384120,       3802396, ...
 5  7 |  6,   96,  1530,   24384,    388614,     6193440,      98706426, ...
 6  8 |  2,   12,    70,     408,      2378,       13860,         80782, ...
 7 10 | 12,  456, 17316,  657552,  24969660,   948189528,   36006232404, ...
 8 11 |  6,  120,  2394,   47760,    952806,    19008360,     379214394, ...
 9 12 |  1,    4,    15,      56,       209,         780,          2911, ...
10 13 |  3,   33,   360,    3927,     42837,      467280,       5097243, ...
11 14 |  8,  240,  7192,  215520,   6458408,   193536720,    5799643192, ...
12 15 |  2,   16,   126,     992,      7810,       61488,        484094, ...
13 17 | 16, 1056, 69680, 4597824, 303386704, 20018924640, 1320945639536, ...
14 18 |  8,  272,  9240,  313888,  10662952,   362226480,   12305037368, ...
...

Rows from n = 1 (nonzero terms): A005319, A052530, A001906, A122652, A001080*2, A001542, A239365, A075844, A001353, A075835, A068204*2, A001090*2, A121740*2, A202299*2.

Cf. A000037, A002420, A033999, A048942, A180495, A298675.

row(n)={my(v=List()); for(t=3, oo, if((t^2-4)%x>0 || !issquare((t^2-4)/x), next); listput(v, sqrtint((t^2-4)/x)); break); listput(v, v[1]*sqrtint(v[1]^2*x+4)); while(#v<10, listput(v, v[#v]*(v[2]/v[1])-v[#v-1])); Vec(v)}
for(n=1, 20, x=n+floor(1/2+sqrt(n)); print (n, " ", x, " ", row(n)))

For x = A000037(n) (nonsquare integer of index n):
If x is not the sum of 2 squares, then T(n, 1) = A048942(n); otherwise, T(n, 1) is a positive integer multiple of A048942(n).
For j in {-2, 1, 2, 4}, if x-j is a square (except 2-2=0^2 or 5-1=2^2), then T(n, 1) = (4/abs(j))*sqrt(x-j) and T(n, 2) = T(n, 1)^3/(4/abs(j)) + sign(j)*2*T(n, 1).
For j in {1, 4}, if x+j is a square, then T(n, 1) = 2/sqrt(4/j) and T(n, 2) = (4/j)*sqrt(x+j).
For k >= 2, T(n, k) = T(n, k-1)*sqrt(T(n, 1)^2*x+4) - [k>=3]*T(n, k-2).
T(n, 2) = Sum_{i=0..oo}(T(n, 1)^(2-2*i) * x^((1-2*i)/2) * A002420(i) * A033999(i)).
If T(n, 1) is even, then T(n, 2) = T(n, 1)*A180495(n); if T(n, 1) is odd and x is even, then T(n, 2) = T(n, 1)*sqrt(A180495(n)+2); if T(n, 1) and x are both odd, then T(n, 2) is a factor of T(n, 1)*A180495(n).
For k >= 3, T(n, k) = T(n, k-1)*(T(n, 2)/T(n, 1)) - T(n, k-2) = T(n, 1)*A298675(T(n, 2)/T(n, 1), k-1) + T(n, k-2) = sqrt((A298675(T(n, 2)/T(n, 1), k)^2-4)/x).

cp's OEIS Frontend

A004190 Expansion of 1/(1 - 11*x + x^2).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Sage

Formula

Extensions

A378908 Square array, read by descending antidiagonals, where each row n comprises the integers w >= 1 such that A000037(n)*w^2+4 is a square.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Formula