cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A109613 Odd numbers repeated.

Original entry on oeis.org

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

Views

Author

Reinhard Zumkeller, Aug 01 2005

Keywords

Comments

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

Examples

			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

References

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

Links

Crossrefs

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

Programs

Formula

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

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

Original entry on oeis.org

1, 3, 6, 10, 14, 18, 22, 26, 30, 34, 38, 42, 46, 50, 54, 58, 62, 66, 70, 74, 78, 82, 86, 90, 94, 98, 102, 106, 110, 114, 118, 122, 126, 130, 134, 138, 142, 146, 150, 154, 158, 162, 166, 170, 174, 178, 182, 186, 190, 194, 198, 202, 206, 210, 214, 218, 222, 226, 230
Offset: 0

Views

Author

Paul Barry, Oct 14 2005

Keywords

Comments

Row sums of number triangle A113126.
Equals binomial transform of [1, 2, 1, 0, -1, 2, -3, 4, -5, ...]. - Gary W. Adamson, Feb 14 2009
From 6 on the same as A016825. - R. J. Mathar, Jul 21 2013
The size of a maximal 4-degenerate graph of order n-2 (this class includes 4-trees). - Allan Bickle, Nov 14 2021
Maximum size of an apex graph of order n-2 (an apex graph can be made planar by deleting a single vertex). - Allan Bickle, Nov 14 2021

Links

Crossrefs

Cf. A016825, A073760, A111284, A131034.
a(n) - a(n-1) = A158411(n+1). - Jaume Oliver Lafont, Mar 27 2009

Programs

  • Magma
    [4*n-2+2*Binomial(0, n)+Binomial(1, n): n in [0..80]]; // Vincenzo Librandi, Nov 03 2018
  • Mathematica
    CoefficientList[Series[(1 + x + x^2 + x^3) / (1 - x)^2, {x, 0, 100}], x] (* Vincenzo Librandi, Nov 03 2018 *)
LinearRecurrence[{2,-1},{1,3,6,10},60] (* Harvey P. Dale, Jul 08 2019 *)
  • PARI
    x='x+O('x^66); Vec((1+x+x^2+x^3)/(1-x)^2) \\ Joerg Arndt, May 06 2013

Formula

a(n) = 4*n - 2 + 2*binomial(0, n) + binomial(1, n);
a(n) = binomial(n+1, n) + binomial(n, n-1) + binomial(n-1, n-2) + binomial(n-2, n-3).
Row sums of triangle A131034. - Gary W. Adamson, Jun 10 2007
G.f.: (x^2-1)/Q(0), where Q(k)= 4*x - 1 + x*k - x*(x-1)*(k+1)/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, May 05 2013
a(n) = A111284(n+1) for n >= 2. - Georg Fischer, Nov 02 2018
a(n) = 4*(n+2) - 10 for n >= 2. - Allan Bickle, Nov 14 2021

A113125 A simple tridiagonal matrix.

Original entry on oeis.org

1, 1, 2, 1, 2, 3, 0, 2, 3, 4, 0, 0, 3, 4, 5, 0, 0, 0, 4, 5, 6, 0, 0, 0, 0, 5, 6, 7, 0, 0, 0, 0, 0, 6, 7, 8, 0, 0, 0, 0, 0, 0, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 8, 9, 10, 0, 0, 0, 0, 0, 0, 0, 0, 9, 10, 11, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 11, 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 12, 13, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 0

Views

Author

Paul Barry, Oct 14 2005

Keywords

Comments

Row sums are A008486 (coordination sequence for graphite net). Diagonal sums are A026741(n+1). Diagonals are A000027.

Examples

			Triangle begins
  1;
  1, 2;
  1, 2, 3;
  0, 2, 3, 4;
  0, 0, 3, 4, 5;
  0, 0, 0, 4, 5, 6;
  0, 0, 0, 0, 5, 6, 7;
  0, 0, 0, 0, 0, 6, 7, 8;

Crossrefs

Cf. A113126.

Programs

  • Mathematica
    Table[If[#<(n-2),0,#]&/@Range[n],{n,15}]//Flatten (* Harvey P. Dale, Oct 14 2022 *)

Formula

Number triangle where column k has g.f. (1+x+x^2)(k+1)x^k.
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.