A067725 -id:A067725 - cp's OEIS frontend

A097658 Duplicate of A067725.

0, 9, 24, 45, 72, 105, 144, 189, 240, 297, 360, 429, 504, 585, 672, 765, 864, 969, 1080

Offset: 0

dead

A005563 a(n) = n*(n+2) = (n+1)^2 - 1.

0, 3, 8, 15, 24, 35, 48, 63, 80, 99, 120, 143, 168, 195, 224, 255, 288, 323, 360, 399, 440, 483, 528, 575, 624, 675, 728, 783, 840, 899, 960, 1023, 1088, 1155, 1224, 1295, 1368, 1443, 1520, 1599, 1680, 1763, 1848, 1935, 2024, 2115, 2208, 2303, 2400, 2499, 2600

Offset: 0

N. J. A. Sloane

Erdős conjectured that n^2 - 1 = k! has a solution if and only if n is 5, 11 or 71 (when k is 4, 5 or 7).
Second-order linear recurrences y(m) = 2y(m-1) + a(n)*y(m-2), y(0) = y(1) = 1, have closed form solutions involving only powers of integers. - Len Smiley, Dec 08 2001
Number of edges in the join of two cycle graphs, both of order n, C_n * C_n. - Roberto E. Martinez II, Jan 07 2002
Let k be a positive integer, M_n be the n X n matrix m_(i,j) = k^abs(i-j) then det(M_n) = (-1)^(n-1)*a(k-1)^(n-1). - Benoit Cloitre, May 28 2002
Also numbers k such that 4*k + 4 is a square. - Cino Hilliard, Dec 18 2003
For each term k, the function sqrt(x^2 + 1), starting with 1, produces an integer after k iterations. - Gerald McGarvey, Aug 19 2004
a(n) mod 3 = 0 if and only if n mod 3 > 0: a(A008585(n)) = 2; a(A001651(n)) = 0; a(n) mod 3 = 2*(1-A079978(n)). - Reinhard Zumkeller, Oct 16 2006
a(n) is the number of divisors of a(n+1) that are not greater than n. - Reinhard Zumkeller, Apr 09 2007
Nonnegative X values of solutions to the equation X^3 + X^2 = Y^2. To find Y values: b(n) = n(n+1)(n+2). - Mohamed Bouhamida, Nov 06 2007
Sequence allows us to find X values of the equation: X + (X + 1)^2 + (X + 2)^3 = Y^2. To prove that X = n^2 + 2n: Y^2 = X + (X + 1)^2 + (X + 2)^3 = X^3 + 7*X^2 + 15X + 9 = (X + 1)(X^2 + 6X + 9) = (X + 1)*(X + 3)^2 it means: (X + 1) must be a perfect square, so X = k^2 - 1 with k>=1. we can put: k = n + 1, which gives: X = n^2 + 2n and Y = (n + 1)(n^2 + 2n + 3). - Mohamed Bouhamida, Nov 12 2007
From R. K. Guy, Feb 01 2008: (Start)
Toads and Frogs puzzle:
This is also the number of moves that it takes n frogs to swap places with n toads on a strip of 2n + 1 squares (or positions, or lily pads) where a move is a single slide or jump, illustrated for n = 2, a(n) = 8 by
   T T - F F
   T - T F F
   T F T - F
   T F T F -
   T F - F T
   - F T F T
   F - T F T
   F F T - T
   F F - T T
I was alerted to this by the Holton article, but on consulting Singmaster's sources, I find that the puzzle goes back at least to 1867.
Probably the first to publish the number of moves for n of each animal was Edouard Lucas in 1883. (End)
a(n+1) = terms of rank 0, 1, 3, 6, 10 = A000217 of A120072 (3, 8, 5, 15). - Paul Curtz, Oct 28 2008
Row 3 of array A163280, n >= 1. - Omar E. Pol, Aug 08 2009
Final digit belongs to a periodic sequence: 0, 3, 8, 5, 4, 5, 8, 3, 0, 9. - Mohamed Bouhamida, Sep 04 2009 [Comment edited by N. J. A. Sloane, Sep 24 2009]
Let f(x) be a polynomial in x. Then f(x + n*f(x)) is congruent to 0 (mod f(x)); here n belongs to N. There is nothing interesting in the quotients f(x + n*f(x))/f(x) when x belongs to Z. However, when x is irrational these quotients consist of two parts, a) rational integers and b) integer multiples of x. The present sequence represents the non-integer part when the polynomial is x^2 + x + 1 and x = sqrt(2), f(x+n*f(x))/f(x) = A056108(n) + a(n)*sqrt(2). - A.K. Devaraj, Sep 18 2009
For n >= 1, a(n) is the number for which 1/a(n) = 0.0101... (A000035) in base (n+1). - Rick L. Shepherd, Sep 27 2009
For n > 0, continued fraction [n, 1, n] = (n+1)/a(n); e.g., [6, 1, 6] = 7/48. - Gary W. Adamson, Jul 15 2010
Starting (3, 8, 15, ...) = binomial transform of [3, 5, 2, 0, 0, 0, ...]; e.g., a(3) = 15 = (1*3 + 2*5 +1*2) = (3 + 10 + 2). - Gary W. Adamson, Jul 30 2010
a(n) is essentially the case 0 of the polygonal numbers. The polygonal numbers are defined as P_k(n) = Sum_{i=1..n} ((k-2)*i-(k-3)). Thus P_0(n) = 2*n-n^2 and a(n) = -P_0(n+2). See also A067998 and for the case k=1 A080956. - Peter Luschny, Jul 08 2011
a(n) is the maximal determinant of a 2 X 2 matrix with integer elements from {1, ..., n+1}, so the maximum determinant of a 2x2 matrix with integer elements from {1, ..., 5} = 5^2 - 1 = a(4) = 24. - Aldo González Lorenzo, Oct 12 2011
Using four consecutive triangular numbers t1, t2, t3 and t4, plot the points (0, 0), (t1, t2), and (t3, t4) to create a triangle. Twice the area of this triangle are the numbers in this sequence beginning with n = 1 to give 8. - J. M. Bergot, May 03 2012
Given a particle with spin S = n/2 (always a half-integer value), the quantum-mechanical expectation value of the square of the magnitude of its spin vector evaluates to  = S(S+1) = n(n+2)/4, i.e., one quarter of a(n) with n = 2S. This plays an important role in the theory of magnetism and magnetic resonance. - Stanislav Sykora, May 26 2012
Twice the harmonic mean [H(x, y) = (2*x*y)/(x + y)] of consecutive triangular numbers A000217(n) and A000217(n+1). - Raphie Frank, Sep 28 2012
Number m such that floor(sqrt(m)) = floor(m/floor(sqrt(m))) - 2 for m > 0. - Takumi Sato, Oct 10 2012
The solutions of equation 1/(i - sqrt(j)) = i + sqrt(j), when i = (n+1), j = a(n). For n = 1, 2 + sqrt(3) = 3.732050.. = A019973. For n = 2, 3 + sqrt(8) = 5.828427... = A156035. - Kival Ngaokrajang, Sep 07 2013
The integers in the closed form solution of a(n) = 2*a(n-1) + a(m-2)*a(n-2), n >= 2, a(0) = 0, a(1) = 1 mentioned by Len Smiley, Dec 08 2001, are m and -m + 2 where m >= 3 is a positive integer. - Felix P. Muga II, Mar 18 2014
Let m >= 3 be a positive integer. If a(n) = 2*a(n-1) + a(m-2) * a(n-2), n >= 2, a(0) = 0, a(1) = 1, then lim_{n->oo} a(n+1)/a(n) = m. - Felix P. Muga II, Mar 18 2014
For n >= 4 the Szeged index of the wheel graph W_n (with n + 1 vertices). In the Sarma et al. reference, Theorem 2.7 is incorrect. - Emeric Deutsch, Aug 07 2014
If P_{k}(n) is the n-th k-gonal number, then a(n) = t*P_{s}(n+2) - s*P_{t}(n+2) for s=t+1. - Bruno Berselli, Sep 04 2014
For n >= 1, a(n) is the dimension of the simple Lie algebra A_n. - Wolfdieter Lang, Oct 21 2015
Finding all positive integers (n, k) such that n^2 - 1 = k! is known as Brocard's problem, (see A085692). - David Covert, Jan 15 2016
For n > 0, a(n) mod (n+1) = a(n) / (n+1) = n. - Torlach Rush, Apr 04 2016
Conjecture: When using the Sieve of Eratosthenes and sieving (n+1..a(n)), with divisors (1..n) and n>0, there will be no more than a(n-1) composite numbers. - Fred Daniel Kline, Apr 08 2016
a(n) mod 8 is periodic with period 4 repeating (0,3,0,7), that is a(n) mod 8 = 5/2 - (5/2) cos(n*Pi) - sin(n*Pi/2) + sin(3*n*Pi/2). - Andres Cicuttin, Jun 02 2016
Also for n > 0, a(n) is the number of times that n-1 occurs among the first (n+1)! terms of A055881. - R. J. Cano, Dec 21 2016
The second diagonal of composites (the only prime is number 3) from the right on the Klauber triangle (see Kival Ngaokrajang link), which is formed by taking the positive integers and taking the first 1, the next 3, the following 5, and so on, each centered below the last. - Charles Kusniec, Jul 03 2017
Also the number of independent vertex sets in the n-barbell graph. - Eric W. Weisstein, Aug 16 2017
Interleaving of A000466 and A033996. - Bruce J. Nicholson, Nov 08 2019
a(n) is the number of degrees of freedom in a triangular cell for a Raviart-Thomas or Nédélec first kind finite element space of order n. - Matthew Scroggs, Apr 22 2020
From Muge Olucoglu, Jan 19 2021: (Start)
For n > 1, a(n-2) is the maximum number of elements in the second stage of the Quine-McCluskey algorithm whose minterms are not covered by the functions of n bits. At n=3, we have a(3-2) = a(1) = 1*(1+2) = 3 and f(A,B,C) = sigma(0,1,2,5,6,7).
.
          0 1 2   5 6 7
        +---------------
  *(0,1)| X X
   (0,2)| X   X
   (1,5)|   X     X
  *(2,6)|     X     X
  *(5,7)|         X   X
   (6,7)|           X X
.
*: represents the elements that are covered. (End)
1/a(n) is the ratio of the sum of the first k odd numbers and the sum of the next n*k odd numbers. - Melvin Peralta, Jul 15 2021
For n >= 1, the continued fraction expansion of sqrt(a(n)) is [n; {1, 2n}]. - Magus K. Chu, Sep 09 2022
Number of diagonals parallel to an edge in a regular (2*n+4)-gon (cf. A367204). - Paolo Xausa, Nov 21 2023
For n >= 1, also the number of minimum cyclic edge cuts in the (n+2)-trapezohedron graph. - Eric W. Weisstein, Nov 21 2024
For n >= 1, a(n) is the sum of the interior angles of a polygon with n+2 sides, in radians, multiplied by (n+2)/Pi. - Stuart E Anderson, Aug 06 2025

			G.f. = 3*x + 8*x^2 + 15*x^3 + 24*x^4 + 35*x^5 + 48*x^6 + 63*x^7 + 80*x^8 + ...

E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982, see index under Toads and Frogs Puzzle.
Martin Gardner, Perplexing Puzzles and Tantalizing Teasers, p. 21 (for "The Dime and Penny Switcheroo").
R. K. Guy, Unsolved Problems in Theory of Numbers, Section D25.
Derek Holton, Math in School, 37 #1 (Jan 2008) 20-22.
Edouard Lucas, Récréations Mathématiques, Gauthier-Villars, Vol. 2 (1883) 141-143.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 0..1000
Jeremiah Bartz, Bruce Dearden, and Joel Iiams, Classes of Gap Balancing Numbers, arXiv:1810.07895 [math.NT], 2018.
Spencer Daugherty, Pamela E. Harris, Ian Klein, and Matt McClinton, Metered Parking Functions, arXiv:2406.12941 [math.CO], 2024. See p. 22.
R. K. Guy, Letter to N. J. A. Sloane, May 1990.
R. K. Guy, Catwalks, sandsteps and Pascal pyramids, J. Integer Sequences, Vol. 3 (2000), Article #00.1.6.
Hsien-Kuei Hwang, S. Janson, and T.-H. Tsai, Exact and asymptotic solutions of the recurrence f(n) = f(floor(n/2)) + f(ceiling(n/2)) + g(n): theory and applications, Preprint, 2016.
Hsien-Kuei Hwang, S. Janson, and T.-H. Tsai, Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications, ACM Transactions on Algorithms, 13:4 (2017), #47; DOI: 10.1145/3127585.
Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets.
F. P. Muga II, Extending the Golden Ratio and the Binet-de Moivre Formula, March 2014; Preprint on ResearchGate.
Kival Ngaokrajang, Klauber triangle
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992.
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014.
K. V. S. Sarma and I. V. N. Uma, On Szeged index of standard graphs, International J. of Math. Archive, 3(8), 2012, 3129-3135. - _Emeric Deutsch_, Aug 07 2014
Stanislav Sýkora, Magnetic Resonance on OEIS, Stan's NMR Blog (Dec 31, 2014), Retrieved Nov 12, 2019.
Leo Tavares, Illustration: Bounded Squares.
Leo Tavares, Illustration: Trapezoids.
Leo Tavares, Illustration: Trapagons.
Eric Weisstein's World of Mathematics, Barbell Graph.
Eric Weisstein's World of Mathematics, Cyclic Edge Cut.
Eric Weisstein's World of Mathematics, Independent Vertex Set.
Eric Weisstein's World of Mathematics, Near-Square Prime.
Eric Weisstein's World of Mathematics, Trapezohedral Graph.
Wikipedia, Quine-McCluskey Algorithm.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

A column of triangle A102537.
a(n+1), n>=2, first column of triangle A120070.
Cf. A000035, A000217, A000290, A000466, A001651, A002378, A005563.
Cf. A007531, A008585, A008833, A013468, A016742, A019973, A028560.
Cf. A033996, A046092, A053186, A054000, A055881, A056108, A062196.
Cf. A068310, A067725, A067728, A067998, A069817, A079978, A080956.
Cf. A085692, A120072, A123865, A123866, A123867, A123868, A134582.
Cf. A140091, A140681, A143053, A144396, A156035, A163280, A212331.
Cf. A253607, A367204.

a005563 n = n * (n + 2)
a005563_list = zipWith (*) [0..] [2..]  -- Reinhard Zumkeller, Dec 16 2012

[n*(n+2): n in [0..60]]; // G. C. Greubel, Mar 29 2024

Table[n^2 - 1, {n, 42}] (* Zerinvary Lajos, Mar 21 2007 *)
ListCorrelate[{1, 2}, Range[-1, 50], {1, -1}, 0, Plus, Times] (* Harvey P. Dale, Aug 29 2015 *)
Range[20]^2 - 1 (* Eric W. Weisstein, Aug 16 2017 *)
Table[n (n + 2), {n, 20}] (* Eric W. Weisstein, Nov 21 2024 *)
CoefficientList[Series[(-3 + x)/(-1 + x)^3, {x, 0, 20}], x] (* Eric W. Weisstein, Nov 21 2024 *)
LinearRecurrence[{3, -3, 1}, {3, 8, 15}, 20] (* Eric W. Weisstein, Nov 21 2024 *)

makelist(n*(n+2), n, 0, 56); /* Martin Ettl, Oct 15 2012 */

a(n)=n*(n+2) \\ Charles R Greathouse IV, Dec 22 2011

concat(0, Vec(x*(3-x)/(1-x)^3 + O(x^90))) \\ Altug Alkan, Oct 22 2015

[n*(n+2) for n in range(61)] # G. C. Greubel, Mar 29 2024

G.f.: x*(3-x)/(1-x)^3. - Simon Plouffe in his 1992 dissertation
a(n) = A000290(n+1) - 1.
A002378(a(n)) = A002378(n)*A002378(n+1); e.g., A002378(15)=240=12*20. - Charlie Marion, Dec 29 2003
a(n) = A067725(n)/3. - Zerinvary Lajos, Mar 06 2007
a(n) = Sum_{k=1..n} A144396(k). - Zerinvary Lajos, May 11 2007
a(n) = A134582(n+1)/4. - Zerinvary Lajos, Feb 01 2008
A143053(a(n)) = A000290(n+1), for n > 0. - Reinhard Zumkeller, Jul 20 2008
a(n) = Real((n+1+i)^2). - Gerald Hillier, Oct 12 2008
A053186(a(n)) = 2*n. - Reinhard Zumkeller, May 20 2009
a(n) = (n! + (n+1)!)/(n-1)!, n > 0. - Gary Detlefs, Aug 10 2009
a(n) = floor(n^5/(n^3+1)) with offset 1 (a(1)=0). - Gary Detlefs, Feb 11 2010
a(n) = a(n-1) + 2*n + 1 (with a(0)=0). - Vincenzo Librandi, Nov 18 2010
Sum_{n>=1} 1/a(n) = 3/4. - Mohammad K. Azarian, Dec 29 2010
a(n) = 2/(Integral_{x=0..Pi/2} (sin(x))^(n-1)*(cos(x))^3), for n > 0. - Francesco Daddi, Aug 02 2011
a(n) = A002378(n) + floor(sqrt(A002378(n))); pronic number + its root. - Fred Daniel Kline, Sep 16 2011
a(n-1) = A008833(n) * A068310(n) for n > 1. - Reinhard Zumkeller, Nov 26 2011
G.f.: U(0) where U(k) = -1 + (k+1)^2/(1 - x/(x + (k+1)^2/U(k+1))); (continued fraction, 3-step). - Sergei N. Gladkovskii, Oct 19 2012
a(n) = 15*C(n+4,3)*C(n+4,5)/(C(n+4,2)*C(n+4,4)). - Gary Detlefs, Aug 05 2013
a(n) = (n+2)!/((n-1)! + n!), n > 0. - Ivan N. Ianakiev, Nov 11 2013
a(n) = 3*C(n+1,2) - C(n,2) for n >= 0. - Felix P. Muga II, Mar 11 2014
a(n) = (A016742(n+1) - 4)/4 for n >= 0. - Felix P. Muga II, Mar 11 2014
a(-2 - n) = a(n) for all n in Z. - Michael Somos, Aug 07 2014
A253607(a(n)) = 1. - Reinhard Zumkeller, Jan 05 2015
E.g.f.: x*(x + 3)*exp(x). - Ilya Gutkovskiy, Jun 03 2016
For n >= 1, a(n^2 + n - 2) = a(n-1) * a(n). - Miko Labalan, Oct 15 2017
Sum_{n>=1} (-1)^(n+1)/a(n) = 1/4. - Amiram Eldar, Nov 04 2020
From Amiram Eldar, Feb 17 2021: (Start)
Product_{n>=1} (1 + 1/a(n)) = 2.
Product_{n>=1} (1 - 1/a(n)) = -sqrt(2)*sin(sqrt(2)*Pi)/Pi. (End)
a(n) = A000290(n+2) - n*2. See Bounded Squares illustration. - Leo Tavares, Oct 05 2021
From Leo Tavares, Oct 10 2021: (Start)
a(n) = A008585(n) + 2*A000217(n-1). See Trapezoids illustration.
2*A005563 = A054000(n+1). See Trapagons illustration.
a(n) = 2*A000217(n) + n. (End)
a(n) = (n+2)!!/(n-2)!! for n > 1. - Jacob Szlachetka, Jan 02 2022

Partially edited by Joerg Arndt, Mar 11 2010

More terms from N. J. A. Sloane, Aug 01 2010

A054000 a(n) = 2*n^2 - 2.

Original entry on oeis.org

0, 6, 16, 30, 48, 70, 96, 126, 160, 198, 240, 286, 336, 390, 448, 510, 576, 646, 720, 798, 880, 966, 1056, 1150, 1248, 1350, 1456, 1566, 1680, 1798, 1920, 2046, 2176, 2310, 2448, 2590, 2736, 2886, 3040, 3198, 3360, 3526, 3696, 3870, 4048, 4230, 4416

Offset: 1

Asher Auel, Jan 12 2000

a(n) is the number of edges in (n+1) X (n+1) square grid with all horizontal, vertical and great diagonal segments filled in.
Nonnegative X values of integer solutions to the equation 2*X^3 + 4*X^2 = Y^2. To find Y values: b(n) = 2*n*(2*n^2 - 2). - Mohamed Bouhamida, Nov 06 2007
Second term of an arithmetic progression of 5 numbers with common difference 2n+1. The sum of squares of such 5 terms equals the sum of squares of 5 consecutive numbers starting a(n) + 2n + 1. - Carmine Suriano, Oct 16 2013
For m > 2, a(m-1) = 2*m*(m-2) is the number of Hamiltonian circuits on an m-gonal bipyramid with labeled vertices. - Stanislav Sykora, Jul 22 2014
a(n+1), n >= 0, appears also as the third member of the quartet [p0(n), p1(n), a(n+1), p3(n)] of the square of [n, n+1, n+2, n+3] in the Clifford algebra Cl_2 for n >= 0. p0(n) = -A147973(n+3), p1(n) = A046092(n) and p3(n) = A139570(n). See a comment on A147973, also with a reference. - Wolfdieter Lang, Oct 15 2014
From Bui Quang Tuan, Mar 31 2015: (Start)
For n >= 2, a(n) is the total sum of all numbers on the perimeter of a square consisting of n columns, each of which contains n numbers 1, 2, 3, ..., n.
Here is an example with n = 5:
  1 1 1 1 1
  2 2 2 2 2
  3 3 3 3 3
  4 4 4 4 4
  5 5 5 5 5
where 1+1+1+1+1 + 2+2 + 3+3 + 4+4 + 5+5+5+5+5 = 48 = a(5).
(End)
Nonnegative k such that k/2+1 is a square. - Bruno Berselli, Apr 10 2018

			For n=5, a(5)=48 and 37^2 + 48^2 + 59^2 + 70^2 + 81^2 = 59^2 + 60^2 + 61^2 + 62^2 + 63^2. - _Carmine Suriano_, Oct 16 2013

G. C. Greubel, Table of n, a(n) for n = 1..5000
Milan Janjić, Pascal Matrices and Restricted Words, J. Int. Seq., Vol. 21 (2018), Article 18.5.2.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

a(n) = A100345(n+1, n-4) for n>2.

Cf. A000217, A001082, A002378, A002943, A005563, A028347, A036666, A046092, A056220, A062717, A067725, A087475.

Maple
```
[ seq(2*n^2 - 2, n=1..60) ];
```

2 Range[50]^2 - 2 (* or *) LinearRecurrence[{3, -3, 1}, {0, 6, 16}, 50] (* Harvey P. Dale, Feb 03 2012 *)
CoefficientList[Series[2 x (3 - x) / (1 - x)^3, {x, 0, 50}], x] (* Vincenzo Librandi, Apr 01 2015 *)

a(n)=2*n^2-2 \\ Charles R Greathouse IV, Sep 24 2015

a(n) = 4*n + a(n-1) - 2, with n>1, a(1)=0. - Vincenzo Librandi, Aug 06 2010
a(1)=0, a(2)=6, a(3)=16; for n>3, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, Feb 03 2012
a(n) = (n+i)^2 + (n-i)^2, where i=sqrt(-1). - Bruno Berselli, Jan 23 2014
a(n) = 1*A000290(n-1) + 2*A000217(n-1) + 3*A001477(n-1). - J. M. Bergot, Apr 23 2014
G.f.: 2*x^2*(3 - x)/(1 - x)^3. - Vincenzo Librandi, Apr 01 2015
E.g.f.: 2*(x^2 + x -1)*exp(x) + 2. - G. C. Greubel, Jul 13 2017
a(n) + a(n+2) = A005843(n+1)^2. - Ezhilarasu Velayutham, May 30 2019
From Amiram Eldar, Dec 09 2021: (Start)
Sum_{n>=2} 1/a(n) = 3/8.
Sum_{n>=2} (-1)^n/a(n) = 1/8. (End)

A067728 a(n) = 2n^2 + 8n.

Original entry on oeis.org

10, 24, 42, 64, 90, 120, 154, 192, 234, 280, 330, 384, 442, 504, 570, 640, 714, 792, 874, 960, 1050, 1144, 1242, 1344, 1450, 1560, 1674, 1792, 1914, 2040, 2170, 2304, 2442, 2584, 2730, 2880, 3034, 3192, 3354, 3520, 3690, 3864, 4042, 4224, 4410, 4600, 4794

Offset: 1

Robert G. Wilson v, Feb 05 2002

Positive numbers k such that 8*(8 + k) is a perfect square.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. 7: A067727, 6: A067726, 5: A067724, 3: A067725.

Cf. A000217, A005563, A140091, A140681, A212331.

[2*n*(n+4): n in [1..50]] // Vincenzo Librandi, Jul 08 2012

Select[ Range[10000], IntegerQ[ Sqrt[ 8(8 + # )]] & ]
CoefficientList[Series[2*(5-3*x)/(1-x)^3,{x,0,50}],x] (* Vincenzo Librandi, Jul 08 2012 *)

a(n)=2*n*(n+4) \\ Charles R Greathouse IV, Dec 07 2011

def a(n): return (2*n + 8)*n
print([a(n) for n in range(1, 48)]) # Michael S. Branicky, Oct 24 2021

a(n+1) = 2*n*n + 12*n + 10. - Frank Ellermann
a(n) = Sum_{k=0..n} Sum_{j=4..n} (j - k), n >= 4. - Zerinvary Lajos, May 11 2007
From Vincenzo Librandi, Jul 08 2012: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
G.f.: 2*x*(5-3*x)/(1-x)^3. (End)
From Amiram Eldar, Feb 25 2022: (Start)
Sum_{n>=1} 1/a(n) = 25/96.
Sum_{n>=1} (-1)^(n+1)/a(n) = 7/96. (End)
E.g.f.: 2*exp(x)*x*(5 + x). - Stefano Spezia, Oct 01 2023

A140676 a(n) = n(3n + 4).

Original entry on oeis.org

0, 7, 20, 39, 64, 95, 132, 175, 224, 279, 340, 407, 480, 559, 644, 735, 832, 935, 1044, 1159, 1280, 1407, 1540, 1679, 1824, 1975, 2132, 2295, 2464, 2639, 2820, 3007, 3200, 3399, 3604, 3815, 4032, 4255, 4484, 4719, 4960, 5207, 5460, 5719, 5984, 6255, 6532, 6815

Offset: 0

Omar E. Pol, May 22 2008

The number of peers of a cell of an n^2 X n^2 sudoku is a(n-1). - Neven Sajko, Apr 20 2016

First differences are in A016921. - Wesley Ivan Hurt, Apr 21 2016

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

Cf. A000567, A016921, A033428, A045944, A067707, A067725, A140677, A140678, A140679, A140680, A140681, A140689.

[n*(3*n+4) : n in [0..80]]; // Wesley Ivan Hurt, Apr 21 2016

A140676:=n->n*(3*n+4): seq(A140676(n), n=0..100); # Wesley Ivan Hurt, Apr 21 2016

Table[n (3 n + 4), {n, 0, 50}] (* or *) LinearRecurrence[{3, -3, 1}, {0, 7, 20}, 50] (* Harvey P. Dale, May 04 2013 *)

a(n)=n*(3*n+4) \\ Charles R Greathouse IV, Oct 07 2015

a(n) = 3*n^2 + 4*n.
a(n) = 6*n + a(n-1) + 1 for n>0, a(0)=0. - Vincenzo Librandi, Aug 03 2010
O.g.f.: x*(7 - x)/(1 - x)^3. - Arkadiusz Wesolowski, Dec 24 2011
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>2. - Harvey P. Dale, May 04 2013
E.g.f.: x*(7 + 3*x)*exp(x). - Ilya Gutkovskiy, Apr 20 2016
a(n) = A000567(n+1) - 1. - Neven Sajko, Apr 20 2016
From Amiram Eldar, Feb 26 2022: (Start)
Sum_{n>=1} 1/a(n) = 15/16 - Pi/(8*sqrt(3)) - 3*log(3)/8.
Sum_{n>=1} (-1)^(n+1)/a(n) = 9/16 - Pi/(4*sqrt(3)). (End)

A140681 a(n) = 3n(n+6).

Original entry on oeis.org

0, 21, 48, 81, 120, 165, 216, 273, 336, 405, 480, 561, 648, 741, 840, 945, 1056, 1173, 1296, 1425, 1560, 1701, 1848, 2001, 2160, 2325, 2496, 2673, 2856, 3045, 3240, 3441, 3648, 3861, 4080, 4305, 4536, 4773, 5016, 5265, 5520, 5781

Offset: 0

Omar E. Pol, May 22 2008

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

Cf. A028560, A033428, A045944, A140676, A067725, A140677, A140678, A067707, A140679, A140680, A140689, A000217, A005563, A067728, A140091, A212331.

A140681:=n->3*n*(n+6); seq(A140681(n), n=0..100); # Wesley Ivan Hurt, Dec 10 2013

Table[3n(n+6), {n,0,100}] (* Wesley Ivan Hurt, Dec 10 2013 *)
LinearRecurrence[{3,-3,1},{0,21,48},50] (* Harvey P. Dale, May 03 2023 *)

a(n)=3*n*(n+6) \\ Charles R Greathouse IV, Jun 17 2017

a(n) = A028560(n)*3 = 3*n^2 + 18*n = n*(3*n+18).
a(n) = 6*n + a(n-1) + 15 with n>0, a(0)=0. - Vincenzo Librandi, Aug 03 2010
from G. C. Greubel, Jul 20 2017: (Start)
G.f.: 3*x*(7 - 5*x)/(1-x)^3.
E.g.f.: 3*x*(x+7)*exp(x). (End)
From Amiram Eldar, Feb 26 2022: (Start)
Sum_{n>=1} 1/a(n) = 49/360.
Sum_{n>=1} (-1)^(n+1)/a(n) = 37/1080. (End)

A067707 a(n) = 3n^2 + 12n.

Original entry on oeis.org

15, 36, 63, 96, 135, 180, 231, 288, 351, 420, 495, 576, 663, 756, 855, 960, 1071, 1188, 1311, 1440, 1575, 1716, 1863, 2016, 2175, 2340, 2511, 2688, 2871, 3060, 3255, 3456, 3663, 3876, 4095, 4320, 4551, 4788, 5031, 5280, 5535, 5796, 6063, 6336, 6615, 6900

Offset: 1

Robert G. Wilson v, Feb 05 2002

Numbers k such that 12*(12 + k) is a perfect square.

a(n) is the second Zagreb index of the gear graph g[n]. The second Zagreb index of a simple connected graph is the sum of the degree products d(i)d(j) over all edges ij of the graph. The gear graph g[n] is defined as a wheel graph with n+1 vertices with a vertex added between each pair of adjacent vertices of the outer cycle. - Emeric Deutsch, Nov 09 2016

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Eric Weisstein's World of Mathematics, Gear Graph.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A067724 (5), A067725 (3), A067726 (6), A067727 (7), A067728, A067705 (11).

[3*n^2 + 12*n: n in [1..50]]; // Vincenzo Librandi, Jul 07 2012

Select[ Range[10000], IntegerQ[ Sqrt[ 12(12 + # )]] & ]
CoefficientList[Series[3*(5-3*x)/(1-x)^3,{x,0,50}],x] (* Vincenzo Librandi, Jul 07 2012 *)

a(n)=3*n*(n+4) \\ Charles R Greathouse IV, Dec 07 2011

G.f.: 3*x*(5 - 3*x)/(1 - x)^3. - Vincenzo Librandi, Jul 07 2012
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Vincenzo Librandi, Jul 07 2012
E.g.f.: 3*x*(x + 5)*exp(x). - G. C. Greubel, Jul 20 2017
From Amiram Eldar, Feb 26 2022: (Start)
Sum_{n>=1} 1/a(n) = 25/144.
Sum_{n>=1} (-1)^(n+1)/a(n) = 7/144. (End)

A067727 a(n) = 7n^2 + 14n.

Original entry on oeis.org

21, 56, 105, 168, 245, 336, 441, 560, 693, 840, 1001, 1176, 1365, 1568, 1785, 2016, 2261, 2520, 2793, 3080, 3381, 3696, 4025, 4368, 4725, 5096, 5481, 5880, 6293, 6720, 7161, 7616, 8085, 8568, 9065, 9576, 10101, 10640, 11193, 11760, 12341, 12936

Offset: 1

Robert G. Wilson v, Feb 05 2002

Positive numbers k such that 7*(7 + k) is a perfect square.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A186029.

Cf. numbers k such that k*(k + m) is a perfect square: A028560 (k=9), A067728 (k=8), A067726 (k=6), A067724 (k=5), A028347 (k=4), A067725 (k=3), A054000 (k=2), A005563 (k=1).

List([1..45], n-> 7*n*(n+2)); # G. C. Greubel, Sep 01 2019

[7*n*(n+2): n in [1..50]]; // Vincenzo Librandi, Jul 08 2012

seq(7*n*(n+2), n=1..45); # G. C. Greubel, Sep 01 2019

Select[ Range[15000], IntegerQ[ Sqrt[ 7(7 + # )]] & ]
CoefficientList[Series[7*(3-x)/(1-x)^3,{x,0,50}],x] (* Vincenzo Librandi, Jul 08 2012 *)
7*(Range[2,45]^2 -1) (* G. C. Greubel, Sep 01 2019 *)
LinearRecurrence[{3,-3,1},{21,56,105},50] (* Harvey P. Dale, Dec 07 2022 *)

a(n)= 7*n*(n+2) \\ Charles R Greathouse IV, Dec 07 2011

[7*n*(n+2) for n in (1..45)] # G. C. Greubel, Sep 01 2019

a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Vincenzo Librandi, Jul 08 2012
G.f.: 7*x*(3-x)/(1-x)^3. - Vincenzo Librandi, Jul 08 2012
E.g.f.: 7*x*(3 + x)*exp(x). - G. C. Greubel, Sep 01 2019
From Amiram Eldar, Feb 25 2022: (Start)
Sum_{n>=1} 1/a(n) = 3/28.
Sum_{n>=1} (-1)^(n+1)/a(n) = 1/28. (End)

Edited by Charles R Greathouse IV, Jul 25 2010

A140677 a(n) = n(3n + 8).

Original entry on oeis.org

0, 11, 28, 51, 80, 115, 156, 203, 256, 315, 380, 451, 528, 611, 700, 795, 896, 1003, 1116, 1235, 1360, 1491, 1628, 1771, 1920, 2075, 2236, 2403, 2576, 2755, 2940, 3131, 3328, 3531, 3740, 3955, 4176, 4403, 4636, 4875, 5120, 5371, 5628

Offset: 0

Omar E. Pol, May 22 2008

			a(1) = 6*1 + 0 + 5 = 11; a(2) = 6*2 + 11 + 5 = 28; a(3) = 6*3 + 28 + 5 = 51. - _Vincenzo Librandi_, Aug 03 2010

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

Cf. A033428, A045944, A140676, A067725, A140678, A067707, A140679, A140680, A140681, A140689.

Table[n(3n+8),{n,0,45}]  (* Harvey P. Dale, Feb 20 2011 *)

a(n)=n*(3*n+8) \\ Charles R Greathouse IV, Jun 17 2017

a(n) = 3*n^2 + 8*n.
a(n) = 6*n + a(n-1) + 5, with a(0)=0. - Vincenzo Librandi, Aug 03 2010
G.f.: x*(11 - 5*x)/(1 - x)^3. - Arkadiusz Wesolowski, Dec 24 2011
E.g.f.: (3*x^2 + 11*x)*exp(x). - G. C. Greubel, Jul 20 2017

A067724 a(n) = 5n^2 + 10n.

Original entry on oeis.org

15, 40, 75, 120, 175, 240, 315, 400, 495, 600, 715, 840, 975, 1120, 1275, 1440, 1615, 1800, 1995, 2200, 2415, 2640, 2875, 3120, 3375, 3640, 3915, 4200, 4495, 4800, 5115, 5440, 5775, 6120, 6475, 6840, 7215, 7600, 7995, 8400, 8815, 9240, 9675

Offset: 1

Robert G. Wilson v, Feb 05 2002

Positive numbers m such that 5*(5 + m) is a perfect square.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. numbers k such that k*(k + m) is a perfect square: A028560 (k=9), A067728 (k=8), A067727 (k=7), A067726 (k=6), A028347 (k=4), A067725 (k=3), A054000 (k=2), A067998 (k=1).

Cf. A055998.

[5*n*(n+2): n in [1..50]]; // Vincenzo Librandi, Jul 08 2012

Select[Range[10000], IntegerQ[ Sqrt[5 (5 + # )]] &]
CoefficientList[Series[5 (3 - x)/(1 - x)^3, {x, 0, 40}], x] (* Vincenzo Librandi, Jul 08 2012 *)
Table[5n^2+10n,{n,60}] (* or *) LinearRecurrence[{3,-3,1},{15,40,75},60] (* Harvey P. Dale, May 22 2018 *)

a(n)=5*n*(n+2) \\ Charles R Greathouse IV, Dec 07 2011

From Vincenzo Librandi, Jul 08 2012: (Start)
G.f.: 5*x*(3 - x)/(1 - x)^3.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). (End)
a(n) = A055998(3*n) + A055998(n). - Bruno Berselli, Sep 23 2016
From Amiram Eldar, Feb 25 2022: (Start)
Sum_{n>=1} 1/a(n) = 3/20.
Sum_{n>=1} (-1)^(n+1)/a(n) = 1/20. (End)
E.g.f.: 5*exp(x)*x*(3 + x). - Stefano Spezia, Oct 01 2023

cp's OEIS Frontend

A097658 Duplicate of A067725.

Views

Author

Keywords

A005563 a(n) = n*(n+2) = (n+1)^2 - 1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

Maxima

PARI

PARI

SageMath

Formula

Extensions

A054000 a(n) = 2*n^2 - 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A067728 a(n) = 2*n^2 + 8*n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Python

Formula

A140676 a(n) = n*(3*n + 4).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A140681 a(n) = 3*n*(n+6).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A067707 a(n) = 3*n^2 + 12*n.

Views

Author

Keywords

Comments

Links

A067728 a(n) = 2n^2 + 8n.

A140676 a(n) = n(3n + 4).

A140681 a(n) = 3n(n+6).

A067707 a(n) = 3n^2 + 12n.

A067727 a(n) = 7n^2 + 14n.

A140677 a(n) = n(3n + 8).

A067724 a(n) = 5n^2 + 10n.