A211955 -id:A211955 - cp's OEIS frontend

A109613 Odd numbers repeated.

1, 1, 3, 3, 5, 5, 7, 7, 9, 9, 11, 11, 13, 13, 15, 15, 17, 17, 19, 19, 21, 21, 23, 23, 25, 25, 27, 27, 29, 29, 31, 31, 33, 33, 35, 35, 37, 37, 39, 39, 41, 41, 43, 43, 45, 45, 47, 47, 49, 49, 51, 51, 53, 53, 55, 55, 57, 57, 59, 59, 61, 61, 63, 63, 65, 65, 67, 67, 69, 69, 71, 71, 73

Offset: 0

Reinhard Zumkeller, Aug 01 2005

The number of rounds in a round-robin tournament with n competitors. - A. Timothy Royappa, Aug 13 2011
Diagonal sums of number triangle A113126. - Paul Barry, Oct 14 2005
When partitioning a convex n-gon by all the diagonals, the maximum number of sides in resulting polygons is 2*floor(n/2)+1 = a(n-1) (from Moscow Olympiad problem 1950). - Tanya Khovanova, Apr 06 2008
The inverse values of the coefficients in the series expansion of f(x) = (1/2)*(1+x)*log((1+x)/(1-x)) lead to this sequence; cf. A098557. - Johannes W. Meijer, Nov 12 2009
From Reinhard Zumkeller, Dec 05 2009: (Start)
First differences: A010673; partial sums: A000982;
A059329(n) = Sum_{k = 0..n} a(k)*a(n-k);
A167875(n) = Sum_{k = 0..n} a(k)*A005408(n-k);
A171218(n) = Sum_{k = 0..n} a(k)*A005843(n-k);
A008794(n+2) = Sum_{k = 0..n} a(k)*A059841(n-k). (End)
Dimension of the space of weight 2n+4 cusp forms for Gamma_0(5). - Michael Somos, May 29 2013
For n > 4: a(n) = A230584(n) - A230584(n-2). - Reinhard Zumkeller, Feb 10 2015
The arithmetic function v+-(n,2) as defined in A290988. - Robert Price, Aug 22 2017
For n > 0, also the chromatic number of the (n+1)-triangular (Johnson) graph. - Eric W. Weisstein, Nov 17 2017
a(n-1), for n >= 1, is also the upper bound a_{up}(b), where b = 2*n + 1, in the first (top) row of the complete coach system Sigma(b) of Hilton and Pedersen [H-P]. All odd numbers <= a_{up}(b) of the smallest positive restricted residue system of b appear once in the first rows of the c(2*n+1) = A135303(n) coaches. If b is an odd prime a_{up}(b) is the maximum. See a comment in the proof of the quasi-order theorem of H-P, on page 263 ["Furthermore, every possible a_i < b/2 ..."]. For an example see below. - Wolfdieter Lang, Feb 19 2020
Satisfies the nested recurrence a(n) = a(a(n-2)) + 2*a(n-a(n-1)) with a(0) = a(1) = 1. Cf. A004001. - Peter Bala, Aug 30 2022
The binomial transform is 1, 2, 6, 16, 40, 96, 224, 512, 1152, 2560,.. (see A057711). - R. J. Mathar, Feb 25 2023

			G.f. = 1 + x + 3*x^2 + 3*x^3 + 5*x^4 + 5*x^5 + 7*x^6 + 7*x^7 + 9*x^8 + 9*x^9 + ...
Complete coach system for (a composite) b = 2*n + 1 = 33: Sigma(33) ={[1; 5], [5, 7, 13; 2, 1, 2]} (the first two rows are here 1 and 5, 7, 13), a_{up}(33) = a(15) = 15. But 15 is not in the reduced residue system modulo 33, so the maximal (odd) a number is 13. For the prime b = 31, a_{up}(31) = a(14) = 15 appears as maximum of the first rows. - _Wolfdieter Lang_, Feb 19 2020

Peter Hilton and Jean Pedersen, A Mathematical Tapestry: Demonstrating the Beautiful Unity of Mathematics, Cambridge University Press, 2010, 3rd printing 2012, pp. (260-281).

Charles R Greathouse IV, Table of n, a(n) for n = 0..10000
Eric Weisstein's World of Mathematics, Chromatic Number
Eric Weisstein's World of Mathematics, Johnson Graph
Eric Weisstein's World of Mathematics, Triangular Graph
Wikipedia, Round-robin tournament
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

Cf. A000217, A063196, A110660, A186421, A186422, A211955, A230584, A290988.
Complement of A052928 with respect to the universe A004526. - Guenther Schrack, Aug 21 2018
First differences of A000982, A061925, A074148, A105343, A116940, and A179207. - Guenther Schrack, Aug 21 2018

a109613 = (+ 1) . (* 2) . (`div` 2)
a109613_list = 1 : 1 : map (+ 2) a109613_list
-- Reinhard Zumkeller, Oct 27 2012, Feb 21 2011

A109613:=n->2*floor(n/2)+1; seq(A109613(k), k=0..100); # Wesley Ivan Hurt, Oct 22 2013

Flatten@ Array[{2# - 1, 2# - 1} &, 37] (* Robert G. Wilson v, Jul 07 2012 *)
(# - Boole[EvenQ[#]] &) /@ Range[80] (* Alonso del Arte, Sep 11 2019 *)
With[{c=2*Range[0,40]+1},Riffle[c,c]] (* Harvey P. Dale, Jan 02 2020 *)

A109613(n)=n>>1<<1+1 \\ Charles R Greathouse IV, Feb 24 2011

def a(n) : return( len( CuspForms( Gamma0( 5), 2*n + 4, prec=1). basis())); # Michael Somos, May 29 2013

((1 to 49) by 2) flatMap { List.fill(2)() } // _Alonso del Arte, Sep 11 2019

a(n) = 2*floor(n/2) + 1.
a(n) = A052928(n) + 1 = 2*A004526(n) + 1.
a(n) = A028242(n) + A110654(n).
a(n) = A052938(n-2) + A084964(n-2) for n > 1. - Reinhard Zumkeller, Aug 27 2005
G.f.: (1 + x + x^2 + x^3)/(1 - x^2)^2. - Paul Barry, Oct 14 2005
a(n) = 2*a(n-2) - a(n-4), a(0) = 1, a(1) = 1, a(2) = 3, a(3) = 3. - Philippe Deléham, Nov 03 2008
a(n) = A001477(n) + A059841(n). - Philippe Deléham, Mar 31 2009
a(n) = 2*n - a(n-1), with a(0) = 1. - Vincenzo Librandi, Nov 13 2010
a(n) = R(n, -2), where R(n, x) is the n-th row polynomial of A211955. a(n) = (-1)^n + 2*Sum_{k = 1..n} (-1)^(n - k - 2)*4^(k-1)*binomial(n+k, 2*k). Cf. A084159. - Peter Bala, May 01 2012
a(n) = A182579(n+1, n). - Reinhard Zumkeller, May 06 2012
G.f.: ( 1 + x^2 ) / ( (1 + x)*(x - 1)^2 ). - R. J. Mathar, Jul 12 2016
E.g.f.: x*exp(x) + cosh(x). - Ilya Gutkovskiy, Jul 12 2016
From Guenther Schrack, Sep 10 2018: (Start)
a(-n) = -a(n-1).
a(n) = A047270(n+1) - (2*n + 2).
a(n) = A005408(A004526(n)). (End)
a(n) = A000217(n) / A004526(n+1), n > 0. - Torlach Rush, Nov 10 2023

A084159 Pell oblongs.

Original entry on oeis.org

1, 3, 21, 119, 697, 4059, 23661, 137903, 803761, 4684659, 27304197, 159140519, 927538921, 5406093003, 31509019101, 183648021599, 1070379110497, 6238626641379, 36361380737781, 211929657785303, 1235216565974041, 7199369738058939, 41961001862379597, 244566641436218639

Offset: 0

Paul Barry, May 18 2003

Essentially the same as A046727.

Albert H. Beiler, Recreations in the theory of numbers, New York, Dover, (2nd ed.) 1966. See Table 60 at p. 123.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
P. E. Trier, "Almost Isosceles" Right-Angled Triangles, Eureka, No. 4, May 1940, pp. 9 - 11.
Index entries for linear recurrences with constant coefficients, signature (5,5,-1).

Cf. A046727 (same sequence except for first term).

Cf. A001333, A001654, A078057, A084158, A084175, A090390, A182432, A211955.

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

b[n_]:= Numerator[FromContinuedFraction[ContinuedFraction[Sqrt[2], n]]];
Join[{1}, Table[b[n+1], {n,50}]*Table[b[n], {n,50}]] (* Vladimir Joseph Stephan Orlovsky, Jan 15 2011 *)
LinearRecurrence[{5,5,-1},{1,3,21},30] (* Harvey P. Dale, Aug 04 2019 *)

[(lucas_number2(2*n+1, 2, -1) + 2*(-1)^n)/4 for n in range(31)] # G. C. Greubel, Oct 11 2022

a(n) = ((sqrt(2)+1)^(2*n+1) - (sqrt(2)-1)^(2*n+1) + 2*(-1)^n)/4.
a(n) = 5*a(n-1) + 5*a(n-2) - a(n-3). - Paul Curtz, May 17 2008
G.f.: (1-x)^2/((1+x)*(1-6*x+x^2)). - R. J. Mathar, Sep 17 2008
a(n) = A078057(n)*A001333(n). - R. J. Mathar, Jul 08 2009
a(n) = A001333(n)*A001333(n+1).
From Peter Bala, May 01 2012: (Start)
a(n) = (-1)^n*R(n,-4), where R(n,x) is the n-th row polynomial of A211955.
a(n) = (-1)^n*1/u*T(n,u)*T(n+1,u) with u = sqrt(-1) and T(n,x) the Chebyshev polynomial of the first kind.
a(n) = (-1)^n + 4*Sum_{k = 1..n} (-1)^(n-k)*8^(k-1)*binomial(n+k,2*k).
Recurrence equations: a(n) = 6*a(n-1) - a(n-2) + 4*(-1)^n, with a(0) = 1 and a(1) = 3; a(n)*a(n-2) = a(n-1)*(a(n-1)+4*(-1)^n).
Sum_{k >= 0} (-1)^k/a(k) = 1/sqrt(2).
1 - 2*(Sum_{k = 0..n} (-1)^k/a(k))^2 = (-1)^(n+1)/A090390(n+1). (End)
a(n) = (A001333(2*n+1) + (-1)^n)/2. - G. C. Greubel, Oct 11 2022
E.g.f.: exp(-x)*(1 + exp(4*x)*(cosh(2*sqrt(2)*x) + sqrt(2)*sinh(2*sqrt(2)*x)))/2. - Stefano Spezia, Aug 03 2024

A101265 a(1) = 1, a(2) = 2, a(3) = 6; a(n) = 5a(n-1) - 5a(n-2) + a(n-3) for n > 3.

Original entry on oeis.org

1, 2, 6, 21, 77, 286, 1066, 3977, 14841, 55386, 206702, 771421, 2878981, 10744502, 40099026, 149651601, 558507377, 2084377906, 7779004246, 29031639077, 108347552061, 404358569166, 1509086724602, 5631988329241, 21018866592361, 78443478040202, 292755045568446

Offset: 1

Lambert Klasen (lambert.klasen(AT)gmx.net) and Gary W. Adamson, Jan 25 2005

Let M = [ 1, 1, 0; 1, 3, 1; 0, 1, 1 ]; then [1,0,0]*M^n = [a(n), A001353(n), A061278(n-1)] for n > 1. Further, A001353 consists of the first differences of {a(n)}, and since a(n) = A061278(n) + 1, A001353 is also the first differences of A061278. Let v(n) = [1,0,0]*M^n; then, for n >= 0, sum(v_i(n)) = A001075(n) and v_1(n) + v_3(n) = A001835(n). The characteristic polynomial of M is x^3 - 5x^2 + 5x - 1. a(n)/a(n-1) tends to 2 + sqrt(3) = 3.732.... (see A019973) (a root of the polynomial and an eigenvalue of the matrix).
Numbers k such that the RootMeanSquare([1..6*k-5]) is an integer. - Ctibor O. Zizka, Dec 17 2008
Place a(n) blue and b(n) red balls in an urn. Draw 3 balls without replacement. Then Probability(3 red balls) = Probability(1 red and 2 blue balls); binomial(b(n),3) = binomial(b(n),1)*binomial(a(n),2); b(n) = A179167(n). - Paul Weisenhorn, Jul 01 2010
Conjecture: consecutive terms of this sequence and consecutive terms of A032908 provide all the positive integer solutions of (a+b)*(a+b+1) == 0 (mod (a*b)). - Robert Israel, Aug 26 2015
Conjecture is true: see StackExchange link. - Robert Israel, Sep 06 2015
Values of a unitary Y-frieze pattern associated to the linearly oriented quiver K3 (i.e., the quiver whose underlying graph is the complete graph on the vertices {1,2,3}, oriented such that i -> j whenever i < j). - Antoine de Saint Germain, Dec 30 2024

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
R. Israel, W. Jagy et al., Diophantine equation (x+y)(x+y+1)-kxy=0, Math StackExchange, Sep 1 2015.
Giovanni Lucca, Circle Chains Inscribed in Symmetrical Lenses and Integer Sequences, Forum Geometricorum, Volume 16 (2016) 419-427.
Index entries for linear recurrences with constant coefficients, signature (5,-5,1).

Cf. A001075, A001353, A001835, A005246, A019973, A032908, A061278, A211955.

a:=[1,2,6];; for n in [4..20] do a[n]:=5a[n-1]-5*a[n-2]+a[n-3]; od; a; #
G. C. Greubel, Dec 23 2019

a101265 n = a101265_list !! (n-1)
a101265_list = 1 : 2 : 6 : zipWith (+) a101265_list
    (map (* 5) $ tail $ zipWith (-) (tail a101265_list) a101265_list)
-- Reinhard Zumkeller, May 18 2014

I:=[1,2,6]; [n le 3 select I[n] else 5*Self(n-1) - 5*Self(n-2) + Self(n-3): n in [1..30]]; // Vincenzo Librandi, Sep 07 2015

r:=sqrt(3): for n from 1 to 100 do a[n]:=(6+(3+r)*(2+r)^(n-1)+(3-r)*(2-r)^(n-1))/12: end do: # Paul Weisenhorn, Jul 01 2010
r:=sqrt(3): a[n]:=round((6+(3+r)*(2+r)^(n-1))/12): # Paul Weisenhorn, Jul 01 2010
f:= proc(n)
  option remember; local x;
  x:= procname(n-1);
  2*x + (sqrt(12*x^2 - 12*x + 1) - 1)/2
end proc:
f(1):= 1:
map(f, [$1..30]); # Robert Israel, Aug 26 2015
seq( simplify((ChebyshevU(n,2) - Chebyshev(n-1,2) + 1)/2), n=0..20); # G. C. Greubel, Dec 23 2019

LinearRecurrence[{5,-5,1},{1,2,6},25] (* Ray Chandler, Jan 27 2014 *)
CoefficientList[Series[(1-3x+x^2)/((1-x)(1-4x+x^2)), {x, 0, 33}], x] (* Vincenzo Librandi, Sep 07 2015 *)
Table[(ChebyshevU[n, 2] - ChebyshevU[n-1, 2] + 1)/2, {n, 0, 20}] (* G. C. Greubel, Dec 23 2019 *)

M = [ 1, 1, 0; 1, 3, 1; 0, 1, 1]; for(i=1,30,print1(([1,0,0]*M^i)[1],","))

{a(n)=polcoeff(x*(1-3*x+x^2)/((1-x)*(1-4*x+x^2)+x*O(x^n)),n)}

{a(n)=if(n==0,1,if(n==1,1,a(n-1)*(a(n-1)+1)/a(n-2)))} /* Paul D. Hanna, Apr 08 2012 */

vector(21, n, (polchebyshev(n, 2, 2) - polchebyshev(n-1, 2, 2) + 1)/2 ) \\ G. C. Greubel, Dec 23 2019

[(chebyshev_U(n,2) - chebyshev_U(n-1,2) + 1)/2 for n in (0..20)] # G. C. Greubel, Dec 23 2019

a(n) = A005246(n)*A005246(n+1). a(n+1) = a(n)*(a(n)+1)/a(n-1). - Franklin T. Adams-Watters, Apr 24 2006
a(n) = (A001835(n) + 1) / 2. - Ralf Stephan, May 16 2007
O.g.f.: x*(1-3*x+x^2)/((1-x)*(1-4*x+x^2)). - R. J. Mathar, Aug 22 2008
a(n) = 1 + A061278(n). - Ctibor O. Zizka, Dec 17 2008
a(n) = 4*a(n-1) - a(n-2) - 1. - N. Sato, Jan 21 2010
a(n) = (6+(3+r)*(2+r)^(n-1) + (3-r)*(2-r)^(n-1))/12; r=sqrt(3). - Paul Weisenhorn, Jul 01 2010
a(n+1) = a(n) * (a(n) + 1) / a(n-1) for n>1 with a(0)=1, a(1)=1. - Paul D. Hanna, Apr 08 2012
From Peter Bala, May 01 2012: (Start)
a(n+1) = 1 + Sum {k = 1..n} 2^(k-1)*binomial(n+k,2*k).
Row sums of A211955.
a(n) = T(n,u)*T(n+1,u)/u with u = sqrt(3) and T(n,x) denotes the Chebyshev polynomial of the first kind.
Sum_{n >= 0} 1/a(n) = sqrt(3). In fact, 3 - (Sum_{n = 0..2*N} 1/a(n))^2 = 2/(A001835(N+1))^2 and 3 - (Sum_{n = 0..2*N+1} 1/a(n))^2 = 3/(A001075(N+1))^2. (End)
From Robert Israel, Aug 26 2015: (Start)
(a(n) + a(n+1))*(a(n) + a(n+1) + 1) = 6 * a(n) * a(n+1).
a(n+1) = 2*a(n) + (sqrt(12*a(n)^2 - 12*a(n) + 1) - 1)/2. (End)
a(n) = (ChebyshevU(n, 2) - ChebyshevU(n-1, 2) + 1)/2 = (ChebyshevT(n, 2) + ChebyshevU(n, 2) + 2)/4. - G. C. Greubel, Dec 23 2019
a(n) = (1+a(n-1))*(1+a(n-2))/a(n-3) for n > 3. - Antoine de Saint Germain, Dec 30 2024

a(26)-a(27) from Vincenzo Librandi, Sep 07 2015

A054318 a(n)-th star number (A003154) is a square.

Original entry on oeis.org

1, 5, 45, 441, 4361, 43165, 427285, 4229681, 41869521, 414465525, 4102785725, 40613391721, 402031131481, 3979697923085, 39394948099365, 389969783070561, 3860302882606241, 38213059042991845, 378270287547312205

Offset: 1

Ignacio Larrosa Cañestro, Feb 27 2000

A two-way infinite sequence which is palindromic.
Also indices of centered hexagonal numbers (A003215) which are also centered square numbers (A001844). - Colin Barker, Jan 02 2015
Also positive integers y in the solutions to 4*x^2 - 6*y^2 - 4*x + 6*y = 0. - Colin Barker, Jan 02 2015

			a(2) = 5 because the 5th Star number (A003154) 121=11^2 is the 2nd that is a square.

Colin Barker, Table of n, a(n) for n = 1..1000
Editors, L'Intermédiaire des Mathématiciens, Query 4500: The equation x(x+1)/2 = y*(y+1)/3, L'Intermédiaire des Mathématiciens, 22 (1915), 255-260 (I).
Editors, L'Intermédiaire des Mathématiciens, Query 4500: The equation x(x+1)/2 = y*(y+1)/3, L'Intermédiaire des Mathématiciens, 22 (1915), 255-260 (II).
Editors, L'Intermédiaire des Mathématiciens, Query 4500: The equation x(x+1)/2 = y*(y+1)/3, L'Intermédiaire des Mathématiciens, 22 (1915), 255-260 (III).
Editors, L'Intermédiaire des Mathématiciens, Query 4500: The equation x(x+1)/2 = y*(y+1)/3, L'Intermédiaire des Mathématiciens, 22 (1915), 255-260 (IV).
Giovanni Lucca, Circle Chains Inscribed in Symmetrical Lenses and Integer Sequences, Forum Geometricorum, Volume 16 (2016) 419-427.
Index entries for two-way infinite sequences
Index entries for linear recurrences with constant coefficients, signature (11,-11,1).

A031138 is 3*a(n)-2. Cf. A003154, A006061, A182432, A211955.
Quintisection of column k=2 of A233427.
Cf. A001844, A003215, A253475.

a:=[1,5,45];; for n in [4..30] do a[n]:=11*a[n-1]-11*a[n-2]+a[n-3]; od; a; # G. C. Greubel, Jul 23 2019

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

CoefficientList[Series[x(1-6x+x^2)/((1-x)(1-10x+x^2)), {x,0,30}], x] (* Michael De Vlieger, Aug 11 2016 *)
LinearRecurrence[{11,-11,1},{1,5,45},30] (* Harvey P. Dale, Nov 05 2016 *)

a(n)=if(n<1,a(1-n),1/2+subst(poltchebi(n)+poltchebi(n-1),x,5)/12)

Vec(x*(1-6*x+x^2)/((1-x)*(1-10*x+x^2)) + O(x^30)) \\ Colin Barker, Jan 02 2015

(x*(1-6*x+x^2)/((1-x)*(1-10*x+x^2))).series(x, 30).coefficients(x, sparse=False) # G. C. Greubel, Jul 23 2019

a(n) = 11*(a(n-1) - a(n-2)) + a(n-3).
a(n) = 1/2 + (3 - sqrt(6))/12*(5 + 2*sqrt(6))^n + (3 + sqrt(6))/12*(5 - 2*sqrt(6))^n.
From Michael Somos, Mar 18 2003: (Start)
G.f.: x*(1-6*x+x^2)/((1-x)*(1-10*x+x^2)).
12*a(n)*a(n-1) + 4 = (a(n) + a(n-1) + 2)^2.
a(n) = a(1-n) = 10*a(n-1) - a(n-2) - 4.
a(n) = 12*a(n-1)^2/(a(n-1) + a(n-2)) - a(n-1).
a(n) = (a(n-1) + 4)*a(n-1)/a(n-2). (End)
From Peter Bala, May 01 2012: (Start)
a(n+1) = 1 + (1/2)*Sum_{k = 1..n} 8^k*binomial(n+k,2*k).
a(n+1) = R(n,4), where R(n,x) is the n-th row polynomial of A211955.
a(n+1) = (1/u)*T(n,u)*T(n+1,u) with u = sqrt(3) and T(n,x) the Chebyshev polynomial of the first kind.
Sum {k>=0} 1/a(k) = sqrt(3/2). (End)
A003154(a(n)) = A006061(n). - Zak Seidov, Oct 22 2012
a(n) = (4*a(n-1) + a(n-1)^2) / a(n-2), n >= 3. - Seiichi Manyama, Aug 11 2016
2*a(n) = 1+A072256(n). - R. J. Mathar, Feb 07 2022

More terms from James Sellers, Mar 01 2000

A182432 Recurrence a(n)a(n-2) = a(n-1)(a(n-1) + 3) with a(0) = 1, a(1) = 4.

Original entry on oeis.org

1, 4, 28, 217, 1705, 13420, 105652, 831793, 6548689, 51557716, 405913036, 3195746569, 25160059513, 198084729532, 1559517776740, 12278057484385, 96664942098337, 761041479302308, 5991666892320124, 47172293659258681, 371386682381749321

Offset: 0

Peter Bala, Apr 30 2012

The non-linear recurrence equation a(n)*a(n-2) = a(n-1)*(a(n-1) + r) with initial conditions a(0) = 1, a(1) = 1 + r has the solution a(n) = 1/2 + (1/2)*Sum_{k = 0..n} (2*r)^k*binomial(n+k,2*k) = 1/2 + b(n,2*r)/2, where b(n,x) are the Morgan-Voyce polynomials of A085478. The recurrence produces sequences A101265 (r = 1), A011900 (r = 2) and A054318 (r = 4), as well as signed versions of A133872 (r = -1), A109613 (r = -2), A146983 (r = -3) and A084159(r = -4).
Also the indices of centered pentagonal numbers (A005891) which are also centered triangular numbers (A005448). - Colin Barker, Jan 01 2015
Also positive integers y in the solutions to 3*x^2 - 5*y^2 - 3*x + 5*y = 0. - Colin Barker, Jan 01 2015

Seiichi Manyama, Table of n, a(n) for n = 0..1116 (first 201 terms from Vincenzo Librandi)
Giovanni Lucca, Circle Chains Inscribed in Symmetrical Lenses and Integer Sequences, Forum Geometricorum, Volume 16 (2016) 419-427.
Eric Weisstein's World of Mathematics, Morgan-Voyce Polynomials
Index entries for linear recurrences with constant coefficients, signature (9,-9,1).

Cf. A011900, A054318, A070997, A101265, A109613, A133872, A146983, A211955.

I:=[1, 4, 28]; [n le 3 select I[n] else 9*Self(n-1)-9*Self(n-2)+Self(n-3): n in [1..25]]; // Vincenzo Librandi, May 18 2012

RecurrenceTable[{a[0]==1,a[1]==4,a[n]==(a[-1+n] (3+a[-1+n]))/a [-2+n]}, a[n],{n,30}] (* or *) LinearRecurrence[{9,-9,1},{1,4,28},30] (* Harvey P. Dale, May 14 2012 *)

Vec((1-5*x+x^2)/((1-x)*(1-8*x+x^2)) + O(x^100)) \\ Colin Barker, Jan 01 2015

a(n) = 1/2 + (1/2)*Sum_{k = 0..n} 6^k*binomial(n+k,2*k).
a(n) = R(n,3) where R(n,x) denotes the row polynomials of A211955.
a(n) = (1/u)*T(n,u)*T(n+1,u) with u = sqrt(5/2) and T(n,x) the n-th Chebyshev polynomial of the first kind.
Recurrence equation: a(n) = 8*a(n-1) - a(n-2) - 3 with a(0) = 1 and a(1) = 4.
O.g.f.: (1 - 5*x + x^2)/((1 - x)*(1 - 8*x + x^2)) = 1 + 4*x + 28*x^2 + ....
Sum_{n >= 0} 1/a(n) = sqrt(5/3); 5 - 3*(Sum_{k = 0..2*n} 1/a(k))^2 = 2/A070997(n)^2.
a(0) = 1, a(1) = 4, a(2) = 28, a(n) = 9*a(n-1) - 9*a(n-2) + a(n-3). - Harvey P. Dale, May 14 2012

A211956 Coefficients of a sequence of polynomials related to the Morgan-Voyce polynomials.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 4, 2, 1, 6, 4, 1, 9, 12, 4, 1, 12, 20, 8, 1, 16, 40, 32, 8, 1, 20, 60, 56, 16, 1, 25, 100, 140, 80, 16, 1, 30, 140, 224, 144, 32, 1, 36, 210, 448, 432, 192, 32, 1, 42, 280, 672, 720, 352, 64, 1, 49, 392, 1176, 1680, 1232, 448, 64

Offset: 0

Peter Bala, Apr 30 2012

The row generating polynomials R(n,x) of A211955 factorize in the ring Z[x] as R(n,x) = P(n,x)*P(n+1,x) for n >= 1: explicitly, P(2*n,x) = 1/2*(b(2*n,2*x) + 1)/b(n,2*x) and P(2*n+1,x) = b(n,2*x), where b(n,x) := Sum_{k = 0..n} binomial(n+k,2*k)*x^k are the Morgan-Voyce polynomials of A085478. This triangle lists the coefficients in ascending powers of x of the polynomials P(n,x).

The odd numbered rows of the present triangle produce triangle A123519; the even numbered row entries are recorded separately in A211957 and appear to equal the unsigned and row reversed form of A204021. The even numbered rows with a factor of 2^(k-1) removed from the k-th column entries produce triangle A208513.

			Triangle begins
.n\k.|..0....1....2....3....4
= = = = = = = = = = = = = = =
..0..|..1
..1..|..1
..2..|..1....1
..3..|..1....2
..4..|..1....4....2
..5..|..1....6....4
..6..|..1....9...12....4
..7..|..1...12...20....8
..8..|..1...16...40...32....8
..9..|..1...20...60...56...16
...

Eric Weisstein's World of Mathematics, Morgan-Voyce polynomials

Cf. A005246 (row sums), A085478, A123519, A204021, A208513, A211955, A211957.

T(n,0) = 1; for k > 0, T(2*n,k) = 2^k * binomial(n+k,2*k) = A123519(n,k);
for k > 0, T(2*n-1,k) = n/(n+k)*(2^k)*binomial(n+k,2*k) = 2^(k-1)*A208513(n,k).
O.g.f.: ((1+t)*(1-t^2)-t^2*x)/((1-t^2)^2-2*t^2*x) = 1 + t + (1+x)*t^2 + (1+2*x)*t^3 + (1+4*x+2*x^2)*t^4 + ....
Row generating polynomials: P(2*n,x) := 1/2*(b(2*n,2*x)+1)/b(n,2*x) and P(2*n+1,x) := b(n,2*x), where b(n,x) := Sum_{k = 0..n} binomial(n+k,2*k)*x^k are the Morgan-Voyce polynomials of A085478.
The product P(n,x)*P(n+1,x) is the n-th row polynomial of A211955.
In terms of T(n,x), the Chebyshev polynomials of the first kind, we have P(2*n,x) = T(2*n,u) and P(2*n+1,x) = 1/u*T(2*n+1,u), where u = sqrt((x+2)/2).
Other representations for the row polynomials include
P(2*n,x) = 1/2*(1+x+sqrt(x^2+2*x))^n + 1/2*(1+x-sqrt(x^2+2*x))^n;
P(2*n,x) = n*Sum_{k = 0..n}(-1)^(n-k)/(n+k) * binomial(n+k,2*k) * (2*x+4)^k for n >= 1;
P(2*n+1,x) = (2*n+1)*Sum_{k=0..n} (-1)^(n-k)/(n+k+1) * binomial(n+k+1,2*k+1) * (2*x+4)^k.
Recurrence equation: P(n+1,x)*P(n-2,x) - P(n,x)*P(n-1,x) = x.
Row sums A005246(n+2).

A123519 Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n).

Original entry on oeis.org

1, 1, 2, 1, 6, 4, 1, 12, 20, 8, 1, 20, 60, 56, 16, 1, 30, 140, 224, 144, 32, 1, 42, 280, 672, 720, 352, 64, 1, 56, 504, 1680, 2640, 2112, 832, 128, 1, 72, 840, 3696, 7920, 9152, 5824, 1920, 256, 1, 90, 1320, 7392, 20592, 32032, 29120, 15360, 4352, 512, 1, 110, 1980, 13728, 48048, 96096, 116480, 87040, 39168, 9728, 1024

Offset: 0

Emeric Deutsch, Oct 16 2006

Sum of terms in row n = A001835(n+1). Sum(k*T(n,k), k=0..n)=A123520(n) (n>=1).

			T(1,1)=2 because a 2 X 3 grid can be tiled in 2 ways with dominoes so that exactly 2 dominoes are in vertical position: place a horizontal domino above or below two adjacent vertical dominoes.

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened
Eric Weisstein's World of Mathematics, Morgan-Voyce Polynomials

Cf. A001835, A123520. A085478, A211955, A211956.

T:=(n,k)->2^k*binomial(n+k,2*k): for n from 0 to 10 do seq(T(n,k),k=0..n) od; # yields sequence in triangular form

Table[2^k*Binomial[n + k, 2*k], {n, 0, 10}, {k, 0, n}] // Flatten (* G. C. Greubel, Oct 14 2017 *)
CoefficientList[Table[Sqrt[2] Cosh[(2 n + 1) ArcSinh[Sqrt[x/2]]]/Sqrt[2 + x], {n, 0, 10}] // FunctionExpand // Simplify, x] // Flatten (* Eric W. Weisstein, Apr 04 2018 *)
CoefficientList[Table[ChebyshevT[2 n - 1, Sqrt[1 + x/2]]/Sqrt[1 + x/2], {n, 10}], x] (* Eric W. Weisstein, Apr 04 2018 *)

for(n=0,10, for(k=0,n, print1(2^k*binomial(n+k,2*k), ", "))) \\ G. C. Greubel, Oct 14 2017

T(n,k) = 2^k * binomial(n+k,2*k).
G.f.: (1-z)/(1 - 2*z + z^2 - 2*t*z).
Sum_{k=0..n} k*T(n,k) = A123520(n) (n>=1).
Row polynomials are b(n,2*x), where b(n,x) := Sum_{k = 0..n} binomial(n+k,2*k) * x^k are the Morgan-Voyce polynomials of A085478. The triangle is made up of the odd-indexed rows of A211956. - Peter Bala, May 01 2012

Terms a(57) onward added by G. C. Greubel, Oct 14 2017

A211957 Triangle of coefficients of a polynomial sequence related to the Morgan-Voyce polynomials A085478.

Original entry on oeis.org

1, 1, 1, 1, 4, 2, 1, 9, 12, 4, 1, 16, 40, 32, 8, 1, 25, 100, 140, 80, 16, 1, 36, 210, 448, 432, 192, 32, 1, 49, 392, 1176, 1680, 1232, 448, 64, 1, 64, 672, 2688, 5280, 5632, 3328, 1024, 128, 1, 81, 1080, 5544, 14256, 20592, 17472, 8640, 2304, 256, 1, 100, 1650, 10560, 34320, 64064, 72800, 51200, 21760, 5120, 512

Offset: 0

Peter Bala, Apr 30 2012

Triangle formed from the even numbered rows of A211956.
The coefficients of the  Morgan-Voyce polynomials b(n,x) := sum {k = 0..n} binomial(n+k,2*k)*x^k are listed in A085478. The rational functions 1/2*(b(2*n,2*x) + 1)/b(n,2*x) turn out to be integer polynomials. Their coefficients are listed in this triangle. These polynomials occur as factors of the row polynomials R(n,x) of A211955.
This triangle appears to be the row reverse of the unsigned triangle |A204021|.

			Triangle begins
.n\k.|..0....1....2....3....4....5....6....7
= = = = = = = = = = = = = = = = = = = = = = =
..0..|..1
..1..|..1....1
..2..|..1....4....2
..3..|..1....9...12....4
..4..|..1...16...40...32....8
..5..|..1...25..100..140...80...16
..6..|..1...36..210..448..432..192...32
..7..|..1...49..392.1176.1680.1232..448...64

R. J. Mathar, Recurrence for the Atkinson-Steenwijk Integrals for Resistors in the Infinite Triangular Lattice, vixra:2208.0111
Eric Weisstein's World of Mathematics, Morgan-Voyce polynomials

A085478, A111125, A204021, A211955, A211956.

T(n,0) = 1 and for k > 0, T(n,k) = n/k*2^(k-1)*binomial(n+k-1,2*k-1) = 2^(k-1)*A208513(n,k).
O.g.f.: ((1-t)-t*x)/((1-t)^2-2*t*x) = 1 + (1+x)*t + (1+4*x+2*x^2)*t^2 + ....
n-th row polynomial R(n,x) = 1/2*(b(2*n,2*x) + 1)/b(n,2*x) = T(2*n,u), where u = sqrt((x+2)/2) and T(n,u) denotes the Chebyshev polynomial of the first kind.
T(n,k) = 2*T(n-1,k)+2*T(n-1,k-1)-T(n-2,k), T(0,0)=T(1,0)=T(1,1)=1, T(n,k)=0 if k<0 or if k>n. - Philippe Deléham, Nov 16 2013

A146983 a(n) = A002531(n)*A002531(n+1).

Original entry on oeis.org

1, 2, 10, 35, 133, 494, 1846, 6887, 25705, 95930, 358018, 1336139, 4986541, 18610022, 69453550, 259204175, 967363153, 3610248434, 13473630586, 50284273907, 187663465045, 700369586270, 2613814880038, 9754889933879, 36405744855481, 135868089488042

Offset: 0

Paul Barry, Nov 04 2008

a(n+1) is the Hankel transform of A051960 aerated.

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

Cf. A001654, A182432, A211955.

a:=[1,2,10];; for n in [4..30] do a[n]:=3*a[n-1]+3*a[n-2]-a[n-3]; od; a; # G. C. Greubel, Jan 09 2020

R:=PowerSeriesRing(Integers(), 30); Coefficients(R!( (1-x+x^2)/((1+x)*(1-4*x+x^2)) )); // G. C. Greubel, Jan 09 2020

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

LinearRecurrence[{3,3,-1}, {1,2,10}, 30] (* G. C. Greubel, Jan 09 2020 *)

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

def A146983_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( (1-x+x^2)/((1+x)*(1-4*x+x^2)) ).list()
A146983_list(30) # G. C. Greubel, Jan 09 2020

From Peter Bala, May 01 2012: (Start)
a(n) = (-1)^n + 3*Sum_{k = 1..n} (-1)^(n-k)*6^(k-1)*binomial(n+k,2*k).
a(n) = (-1)^n*R(n,-3), where R(n,x) is the n-th row polynomial of A211955.
a(n) = (-1)^n*1/u*T(n,u)*T(n+1,u) with u = sqrt(-1/2) and T(n,x) denotes the Chebyshev polynomial of the first kind  Cf. A182432.
Recurrence: a(n) = 4*a(n-1) -a(n-2) +3*(-1)^n, with a(0) = 1 and a(1) = 2; a(n)*a(n-2) = a(n-1)*(a(n-1)+3*(-1)^n).
Sum_{k>=0} (-1)^k/a(k) = 1/sqrt(3). (End)
From Colin Barker, Jul 29 2013: (Start)
a(n) = 3*a(n-1) + 3*a(n-2) - a(n-3).
G.f.: (1-x+x^2)/((1+x)*(1-4*x+x^2)). (End)

More terms from Colin Barker, Jul 29 2013

cp's OEIS Frontend

A109613 Odd numbers repeated.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Sage

Scala

Formula

A084159 Pell oblongs.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

A101265 a(1) = 1, a(2) = 2, a(3) = 6; a(n) = 5*a(n-1) - 5*a(n-2) + a(n-3) for n > 3.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

PARI

PARI

PARI

Sage

Formula

Extensions

A054318 a(n)-th star number (A003154) is a square.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

PARI

Sage

Formula

Extensions

A182432 Recurrence a(n)*a(n-2) = a(n-1)*(a(n-1) + 3) with a(0) = 1, a(1) = 4.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A101265 a(1) = 1, a(2) = 2, a(3) = 6; a(n) = 5a(n-1) - 5a(n-2) + a(n-3) for n > 3.

A182432 Recurrence a(n)a(n-2) = a(n-1)(a(n-1) + 3) with a(0) = 1, a(1) = 4.