A094159 -id:A094159 - cp's OEIS frontend

A045943 Triangular matchstick numbers: a(n) = 3n(n+1)/2.

0, 3, 9, 18, 30, 45, 63, 84, 108, 135, 165, 198, 234, 273, 315, 360, 408, 459, 513, 570, 630, 693, 759, 828, 900, 975, 1053, 1134, 1218, 1305, 1395, 1488, 1584, 1683, 1785, 1890, 1998, 2109, 2223, 2340, 2460, 2583, 2709, 2838, 2970, 3105, 3243, 3384, 3528

Offset: 0

R. K. Guy

Also, 3 times triangular numbers, a(n) = 3*A000217(n).
In the 24-bit RGB color cube, the number of color-lattice-points in r+g+b = n planes at n < 256 equals the triangular numbers. For n = 256, ..., 765 the number of legitimate color partitions is less than A000217(n) because {r,g,b} components cannot exceed 255. For n = 256, ..., 511, the number of non-color partitions are computable with A045943(n-255), while for n = 512, ..., 765, the number of color points in r+g+b planes equals A000217(765-n). - Labos Elemer, Jun 20 2005
If a 3-set Y and an (n-3)-set Z are disjoint subsets of an n-set X then a(n-3) is the number of 3-subsets of X intersecting both Y and Z. - Milan Janjic, Sep 19 2007
a(n) is also the smallest number that may be written both as the sum of n-1 consecutive positive integers and n consecutive positive integers. - Claudio Meller, Oct 08 2010
For n >= 3, a(n) equals 4^(2+n)*Pi^(1 - n) times the coefficient of zeta(3) in the following integral with upper bound Pi/4 and lower bound 0: int x^(n+1) tan x dx. - John M. Campbell, Jul 17 2011
The difference a(n)-a(n-1) = 3*n, for n >= 1. - Stephen Balaban, Jul 25 2011 [Comment clarified by N. J. A. Sloane, Aug 01 2024]
Sequence found by reading the line from 0, in the direction 0, 3, ..., and the same line from 0, in the direction 0, 9, ..., in the square spiral whose vertices are the generalized pentagonal numbers A001318. This is one of the orthogonal axes of the spiral; the other is A032528. - Omar E. Pol, Sep 08 2011
A005449(a(n)) = A000332(3n + 3) = C(3n + 3, 4), a second pentagonal number of triangular matchstick number index number. Additionally, a(n) - 2n is a pentagonal number (A000326). - Raphie Frank, Dec 31 2012
Sum of the numbers from n to 2n. - Wesley Ivan Hurt, Nov 24 2015
Number of orbits of Aut(Z^7) as function of the infinity norm (n+1) of the representative integer lattice point of the orbit, when the cardinality of the orbit is equal to 5376 or 17920 or 20160. - Philippe A.J.G. Chevalier, Dec 28 2015
Also the number of 4-cycles in the (n+4)-triangular honeycomb acute knight graph. - Eric W. Weisstein, Jul 27 2017
Number of terms less than 10^k, k=0,1,2,3,...: 1, 3, 8, 26, 82, 258, 816, 2582, 8165, 25820, 81650, 258199, 816497, 2581989, 8164966, ... - Muniru A Asiru, Jan 24 2018
Numbers of the form 3*m*(2*m + 1) for m = 0, -1, 1, -2, 2, -3, 3, ... - Bruno Berselli, Feb 26 2018
Partial sums of A008585. - Omar E. Pol, Jun 20 2018
Column 1 of A273464. (Number of ways to select a unit lozenge inside an isosceles triangle of side length n; all vertices on a hexagonal lattice.) - R. J. Mathar, Jul 10 2019
Total number of pips in the n-th suit of a double-n domino set. - Ivan N. Ianakiev, Aug 23 2020

			From _Stephen Balaban_, Jul 25 2011: (Start)
T(n), the triangular numbers = number of nodes,
a(n-1) = number of edges in the T(n) graph:
       o    (T(1) = 1, a(0) = 0)
       o
      / \   (T(2) = 3, a(1) = 3)
     o - o
       o
      / \
     o - o  (T(3) = 6, a(2) = 9)
    / \ / \
   o - o - o
... [Corrected by _N. J. A. Sloane_, Aug 01 2024] (End)

Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 543.

Vincenzo Librandi, Table of n, a(n) for n = 0..2000
Abderrahim Arabi, Hacène Belbachir, and Jean-Philippe Dubernard, Enumeration of parallelogram polycubes, arXiv:2105.00971 [cs.DM], 2021.
Francesco Brenti and Paolo Sentinelli, Wachs permutations, Bruhat order and weak order, arXiv:2212.04932 [math.CO], 2022.
Sela Fried, Counting r X s rectangles in nondecreasing and Smirnov words, arXiv:2406.18923 [math.CO], 2024. See p. 5.
Jose Manuel Garcia Calcines, Luis Javier Hernandez Paricio, and Maria Teresa Rivas Rodriguez, Semi-simplicial combinatorics of cyclinders and subdivisions, arXiv:2307.13749 [math.CO], 2023. See p. 29.
T. Aaron Gulliver, Sums of Powers of Integers Divisible by Three, Int. J. Contemp. Math. Sciences, Vol. 7, 2012, no. 38, 1895 - 1901.
Alfred Hoehn, Illustration of initial terms of A000326, A005449, A045943, A115067
Milan Janjic, Two Enumerative Functions
Milan Janjic and Boris Petkovic, A Counting Function, arXiv preprint arXiv:1301.4550 [math.CO], 2013.
Milan Janjic and Boris Petkovic, A Counting Function Generalizing Binomial Coefficients and Some Other Classes of Integers, J. Int. Seq. 17 (2014) # 14.3.5.
E. Lábos, On the number of RGB-colors we can distinguish. Partition Spectra. Lecture at 7th Hungarian Conference on Biometry and Biomathematics. Budapest. Jul 06, 2005. Applied Ecology and Environmental Research 4(2): 159-169, 2006.
R. J. Mathar, Lozenge tilings of the equilateral triangle, arXiv:1909.06336 [math.CO], 2019.
Eric Weisstein's World of Mathematics, Graph Cycle.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A005448, A002378, A046092, A051162, A126804, A001318, A032528.
3 times n-gonal numbers: A033428, A062741, A094159, A152773, A152751, A152759, A152767, A153783, A153448, A153875.
The generalized pentagonal numbers b*n+3*n*(n-1)/2, for b = 1 through 12, form sequences A000326, A005449, A045943, A115067, A140090, A140091, A059845, A140672, A140673, A140674, A140675, A151542.
A diagonal of A010027.
Orbits of Aut(Z^7) as function of the infinity norm A000579, A154286, A102860, A002412, A115067, A008585, A005843, A001477, A000217.
Cf. A027480 (partial sums).
Cf. A002378 (3-cycles in triangular honeycomb acute knight graph), A028896 (5-cycles), A152773 (6-cycles).
This sequence: Sum_{k = n..2*n} k.
Cf. A304993:   Sum_{k = n..2*n} k*(k+1)/2.
Cf. A050409:   Sum_{k = n..2*n} k^2.
Similar sequences are listed in A316466.

List([0..10^4], n -> 3*n*(n+1)/2); # Muniru A Asiru, Jan 24 2018

a n = sum [x | x <- [n..2*n]] -- Peter Kagey, Jul 27 2015

[3*n*(n+1)/2: n in [0..50]]; // Vincenzo Librandi, May 02 2011

seq(3*binomial(n+1,2), n=0..49); # Zerinvary Lajos, Nov 24 2006

Table[3 n (n + 1)/2, {n, 0, 50}] (* Vladimir Joseph Stephan Orlovsky, Oct 31 2008 *)
3 Accumulate@Range[0, 48] (* Arkadiusz Wesolowski, Oct 29 2012 *)
CoefficientList[Series[-3 x/(x - 1)^3, {x, 0, 47}], x] (* Robert G. Wilson v, Jan 29 2015 *)
LinearRecurrence[{3, -3, 1}, {0, 3, 9}, 50] (* Jean-François Alcover, Dec 12 2016 *)

a(n)=3*binomial(n+1,2) \\ Charles R Greathouse IV, Jun 16 2011

(3 to 150 by 3).scanLeft(0)( + ) // Alonso del Arte, Sep 12 2019

a(n) is the sum of n+1 integers starting from n, i.e., 1+2, 2+3+4, 3+4+5+6, 4+5+6+7+8, etc. - Jon Perry, Jan 15 2004
a(n) = A126890(n+1,n-1) for n>1. - Reinhard Zumkeller, Dec 30 2006
a(n) + A145919(3*n+3) = 0. - Matthew Vandermast, Oct 28 2008
a(n) = A000217(2*n) - A000217(n-1); A179213(n) <= a(n). - Reinhard Zumkeller, Jul 05 2010
a(n) = a(n-1)+3*n, n>0. - Vincenzo Librandi, Nov 18 2010
G.f.: 3*x/(1-x)^3. - Bruno Berselli, Jan 21 2011
a(n) = A005448(n+1) - 1. - Omar E. Pol, Oct 03 2011
a(n) = A001477(n)+A000290(n)+A000217(n). - J. M. Bergot, Dec 08 2012
a(n) = 3*a(n-1)-3*a(n-2)+a(n-3) for n>2. - Wesley Ivan Hurt, Nov 24 2015
a(n) = A027480(n)-A027480(n-1). - Peter M. Chema, Jan 18 2017.
2*a(n)+1 = A003215(n). - Miquel Cerda, Jan 22 2018
a(n) = T(2*n) - T(n-1), where T(n) = A000217(n). In general, T(k)*T(n) = Sum_{i=0..k-1} (-1)^i*T((k-i)*(n-i)). - Charlie Marion, Dec 06 2020
E.g.f.: 3*exp(x)*x*(2 + x)/2. - Stefano Spezia, May 19 2021
From Amiram Eldar, Jan 10 2022: (Start)
Sum_{n>=1} 1/a(n) = 2/3.
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*(2*log(2)-1)/3. (End)
Product_{n>=1} (1 - 1/a(n)) = -(3/(2*Pi))*cos(sqrt(11/3)*Pi/2). - Amiram Eldar, Feb 21 2023

A033428 a(n) = 3*n^2.

Original entry on oeis.org

0, 3, 12, 27, 48, 75, 108, 147, 192, 243, 300, 363, 432, 507, 588, 675, 768, 867, 972, 1083, 1200, 1323, 1452, 1587, 1728, 1875, 2028, 2187, 2352, 2523, 2700, 2883, 3072, 3267, 3468, 3675, 3888, 4107, 4332, 4563, 4800, 5043, 5292, 5547, 5808, 6075, 6348

Offset: 0

Jeff Burch

The number of edges of a complete tripartite graph of order 3n, K_n,n,n. - Roberto E. Martinez II, Oct 18 2001
From Floor van Lamoen, Jul 21 2001: (Start)
Write 1,2,3,4,... in a hexagonal spiral around 0; then a(n) is the sequence found by reading the line from 0 in the direction 0,3,.... The spiral begins:
.
            33--32--31--30
            /             \
          34  16--15--14  29
          /   /         \   \
        35  17   5---4  13  28
        /   /   /     \   \   \
      36  18   6   0---3--12--27--48-->
      /   /   /   /   /   /   /   /
    37  19   7   1---2  11  26  47
      \   \   \         /   /   /
      38  20   8---9--10  25  46
        \   \             /   /
        39  21--22--23--24  45
          \                 /
          40--41--42--43--44
(End)
Number of edges of the complete bipartite graph of order 4n, K_n,3n. - Roberto E. Martinez II, Jan 07 2002
Also the number of partitions of 6n + 3 into at most 3 parts. - R. K. Guy, Oct 23 2003
Also the number of partitions of 6n into exactly 3 parts. - Colin Barker, Mar 23 2015
Numbers n such that the imaginary quadratic field Q[sqrt(-n)] has six units. - Marc LeBrun, Apr 12 2006
The denominators of Hoehn's sequence (recalled by G. L. Honaker, Jr.) and the numerators of that sequence reversed. The sequence is 1/3, (1+3)/(5+7), (1+3+5)/(7+9+11), (1+3+5+7)/(9+11+13+15), ...; reduced to 1/3, 4/12, 9/27, 16/48, ... . For the reversal, the reduction is 3/1, 12/4, 27/9, 48/16, ... . - Enoch Haga, Oct 05 2007
Right edge of tables in A200737 and A200741: A200737(n, A000292(n)) = A200741(n, A100440(n)) = a(n). - Reinhard Zumkeller, Nov 21 2011
The Wiener index of the crown graph G(n) (n>=3). The crown graph G(n) is the graph with vertex set {x(1), x(2), ..., x(n), y(1), y(2), ..., y(n)} and edge set {(x(i), y(j)): 1<=i, j<=n, i/=j} (= the complete bipartite graph K(n,n) with horizontal edges removed). Example: a(3)=27 because G(3) is the cycle C(6) and 6*1 + 6*2 + 3*3 = 27. The Hosoya-Wiener polynomial of G(n) is n(n-1)(t+t^2)+nt^3. - Emeric Deutsch, Aug 29 2013
From Michel Lagneau, May 04 2015: (Start)
Integer area A of equilateral triangles whose side lengths are in the commutative ring Z[3^(1/4)] = {a + b*3^(1/4) + c*3^(1/2) + d*3^(3/4), a,b,c and d in Z}.
The area of an equilateral triangle of side length k is given by A = k^2*sqrt(3)/4. In the ring Z[3^(1/4)], if k = q*3^(1/4), then A = 3*q^2/4 is an integer if q is even. Example: 27 is in the sequence because the area of the triangle (6*3^(1/4), 6*3^(1/4), 6*3^(1/4)) is 27. (End)
a(n) is 2*sqrt(3) times the area of a 30-60-90 triangle with short side n. Also, 3 times the area of an n X n square. - Wesley Ivan Hurt, Apr 06 2016
Consider the hexagonal tiling of the plane. Extract any four hexagons adjacent by edge. This can be done in three ways. Fold the four hexagons so that all opposite faces occupy parallel planes. For all parallel projections of the resulting object, at least two correspond to area a(n) for side length of n of the original hexagons. - Torlach Rush, Aug 17 2022
The sequence terms are the exponents in the expansion of Product_{n >= 1} (1 - q^(3*n))/(1 + q^(3*n)) = ( Sum_{n in Z} q^(n*(3*n+1)/2) ) / ( Product_{n >= 1} 1 + q^n ) = 1 - 2*q^3 + 2*q^12 - 2*q^27 + 2*q^48 - 2*q^75 + - .... - Peter Bala, Dec 30 2024

			From _Ilya Gutkovskiy_, Apr 13 2016: (Start)
Illustration of initial terms:
.                                              o
.                                             o o
.                                            o   o
.                          o                o  o  o
.                         o o              o  o o  o
.                        o   o            o  o   o  o
.           o           o  o  o          o  o  o  o  o
.          o o         o  o o  o        o  o  o o  o  o
.         o   o       o  o   o  o      o  o  o   o  o  o
.  o     o  o  o     o  o  o  o  o    o  o  o  o  o  o  o
. o o   o  o o  o   o  o  o o  o  o  o  o  o  o o  o  o  o
. n=1      n=2            n=3                 n=4
(End)

Nathaniel Johnston, Table of n, a(n) for n = 0..10000
Francesco Brenti and Paolo Sentinelli, Wachs permutations, Bruhat order and weak order, arXiv:2212.04932 [math.CO], 2022.
A. J. C. Cunningham, Factorisation of N and N' = (x^n -+ y^n) / (x -+ y) [when x-y=n], Messenger Math., 54 (1924), 17-21. [Incomplete annotated scanned copy]
Frank Ellermann, Illustration of binomial transforms.
Aoife Hennessy, A Study of Riordan Arrays with Applications to Continued Fractions, Orthogonal Polynomials and Lattice Paths, Ph. D. Thesis, Waterford Institute of Technology, Oct. 2011.
Leo Tavares, Hexagonal illustration
Eric Weisstein's World of Mathematics, Crown Graph.
Eric Weisstein's World of Mathematics, Wiener Index.
Eric Weisstein's World of Mathematics, Unit.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000567, A000217, A000290, A033581, A033583, A092205, A092206.
3 times n-gonal numbers: A045943, A062741, A094159, A152773, A152751, A152759, A152767, A153783, A153448, A153875.
Cf. A219056.
Cf. A000326, A005449, A086463.
Cf. A003215, A016777.

a033428 = (* 3) . (^ 2)
a033428_list = 0 : 3 : 12 : zipWith (+) a033428_list
   (map (* 3) $ tail $ zipWith (-) (tail a033428_list) a033428_list)
-- Reinhard Zumkeller, Jul 11 2013

[3*n^2: n in [0..50]]; // Vincenzo Librandi, May 18 2015

seq(3*n^2, n=0..46); # Nathaniel Johnston, Jun 26 2011

3 Range[0, 50]^2
LinearRecurrence[{3, -3, 1}, {0, 3, 12}, 50] (* Harvey P. Dale, Feb 16 2013 *)

makelist(3*n^2,n,0,30); /* Martin Ettl, Nov 12 2012 */

PARI
```
a(n)=3*n^2
```

def a(n): return 3 * (n**2) # Torlach Rush, Aug 25 2022

a(n) = 3*a(n-1)-3*a(n-2)+a(n-3) for n>2.
G.f.: 3*x*(1+x)/(1-x)^3. - R. J. Mathar, Sep 09 2008
Main diagonal of triangle in A132111: a(n) = A132111(n,n). - Reinhard Zumkeller, Aug 10 2007
A214295(a(n)) = -1. - Reinhard Zumkeller, Jul 12 2012
a(n) = A215631(n,n) for n > 0. - Reinhard Zumkeller, Nov 11 2012
a(n) = A174709(6n+2). - Philippe Deléham, Mar 26 2013
a(n) = a(n-1) + 6*n - 3, with a(0)=0. - Jean-Bernard François, Oct 04 2013
E.g.f.: 3*x*(1 + x)*exp(x). - Ilya Gutkovskiy, Apr 13 2016
a(n) = t(3*n) - 3*t(n), where t(i) = i*(i+k)/2 for any k. Special case (k=1): A000217(3*n) - 3*A000217(n). - Bruno Berselli, Aug 31 2017
a(n) = A000326(n) + A005449(n). - Bruce J. Nicholson, Jan 10 2020
From Amiram Eldar, Jul 03 2020: (Start)
Sum_{n>=1} 1/a(n) = Pi^2/18 (A086463).
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi^2/36. (End)
From Amiram Eldar, Feb 03 2021: (Start)
Product_{n>=1} (1 + 1/a(n)) = sqrt(3)*sinh(Pi/sqrt(3))/Pi.
Product_{n>=1} (1 - 1/a(n)) = sqrt(3)*sin(Pi/sqrt(3))/Pi. (End)
a(n) = A003215(n) - A016777(n). - Leo Tavares, Apr 29 2023

Better description from N. J. A. Sloane, May 15 1998

A062741 3 times pentagonal numbers: 3n(3*n-1)/2.

Original entry on oeis.org

0, 3, 15, 36, 66, 105, 153, 210, 276, 351, 435, 528, 630, 741, 861, 990, 1128, 1275, 1431, 1596, 1770, 1953, 2145, 2346, 2556, 2775, 3003, 3240, 3486, 3741, 4005, 4278, 4560, 4851, 5151, 5460, 5778, 6105, 6441, 6786, 7140, 7503, 7875, 8256, 8646, 9045

Offset: 0

Floor van Lamoen, Jul 21 2001

Write 0,1,2,3,4,... in a triangular spiral; then a(n) is the sequence found by reading from 0 in the vertical upward direction.

Number of edges in the join of two complete graphs of order 2n and n, K_2n * K_n - Roberto E. Martinez II, Jan 07 2002

			The spiral begins:
            15
          16  14
        17   3  13
      18   4   2  12
    19   5   0   1  11
  20   6   7   8   9  10

Nathaniel Johnston, Table of n, a(n) for n = 0..10000
Franck Ramaharo, Statistics on some classes of knot shadows, arXiv:1802.07701 [math.CO], 2018.
Franck Ramaharo, A generating polynomial for the pretzel knot, arXiv:1805.10680 [math.CO], 2018.
Amelia Carolina Sparavigna, The groupoid of the Triangular Numbers and the generation of related integer sequences, Politecnico di Torino, Italy (2019).
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000326, A008585, A051682, A218470.

Cf. 3 times n-gonal numbers: A045943, A033428, A094159, A152773, A152751, A152759, A152767, A153783, A153448, A153875.

[Binomial(3*n,2): n in [0..50]]; // G. C. Greubel, Dec 26 2023

[seq(binomial(3*n,2),n=0..45)]; # Zerinvary Lajos, Jan 02 2007

3*PolygonalNumber[5,Range[0,50]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Mar 06 2019 *)

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

[binomial(3*n,2) for n in range(51)] # G. C. Greubel, Dec 26 2023

a(n) = binomial(3*n, 2). - Zerinvary Lajos, Jan 02 2007
a(n) = (9*n^2 - 3*n)/2 = 3*n(3*n-1)/2 = A000326(n)*3. - Omar E. Pol, Dec 11 2008
a(n) = a(n-1) + 9*n - 6, with n > 0, a(0)=0. - Vincenzo Librandi, Aug 07 2010
G.f.: 3*x*(1+2*x)/(1-x)^3. - Bruno Berselli, Jan 21 2011
a(n) = A218470(9n+2). - Philippe Deléham, Mar 27 2013
a(n) = n*A008585(n) + Sum_{i=0..n-1} A008585(i) for n > 0. - Bruno Berselli, Dec 19 2013
From Amiram Eldar, Jan 10 2022: (Start)
Sum_{n>=1} 1/a(n) = log(3) - Pi/(3*sqrt(3)).
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*Pi/(3*sqrt(3)) - 4*log(2)/3. (End)
E.g.f.: (3/2)*x*(2 + 3*x)*exp(x). - G. C. Greubel, Dec 26 2023

Better definition and edited by Omar E. Pol, Dec 11 2008

A152751 3 times octagonal numbers: a(n) = 3n(3*n-2).

Original entry on oeis.org

0, 3, 24, 63, 120, 195, 288, 399, 528, 675, 840, 1023, 1224, 1443, 1680, 1935, 2208, 2499, 2808, 3135, 3480, 3843, 4224, 4623, 5040, 5475, 5928, 6399, 6888, 7395, 7920, 8463, 9024, 9603, 10200, 10815, 11448, 12099, 12768, 13455, 14160, 14883, 15624, 16383, 17160

Offset: 0

Omar E. Pol, Dec 12 2008

a(n) also can be represented as n concentric triangles (see example). - Omar E. Pol, Aug 21 2011

			From _Omar E. Pol_, Aug 21 2011: (Start)
Illustration of initial terms as concentric triangles:
.
.                                          o
.                                         o o
.                                        o   o
.                                       o     o
.                 o                    o   o   o
.                o o                  o   o o   o
.               o   o                o   o   o   o
.              o     o              o   o     o   o
.    o        o   o   o            o   o   o   o   o
.   o o      o   o o   o          o   o   o o   o   o
.           o           o        o   o           o   o
.          o o o o o o o o      o   o o o o o o o o   o
.                              o                       o
.                             o o o o o o o o o o o o o o
.
.    3            24                       63
(End)

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

Cf. A000567, A064201, A139267, A152995.
3 times n-gonal numbers: A045943, A033428, A062741, A094159, A152773, A152759, A152767, A153783, A153448, A153875.
Cf. A033581, A085250, A152734, A194273. - Omar E. Pol, Aug 21 2011
Cf. numbers of the form n*(n*k - k + 6)/2, this sequence is the case k=18: see Comments lines of A226492.

s=0;lst={s};Do[s+=n;AppendTo[lst,s],{n,3,6!,18}];lst (* Vladimir Joseph Stephan Orlovsky, Apr 02 2009 *)
3*PolygonalNumber[8,Range[0,40]] (* Harvey P. Dale, May 08 2022 *)

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

a(n) = 9*n^2 - 6*n = 3*A000567(n) = A064201(n)/3.
a(n) = a(n-1) + 18*n - 15 with n > 0, a(0)=0. - Vincenzo Librandi, Nov 26 2010
G.f.: 3*x*(1+5*x)/(1-x)^3. - Bruno Berselli, Jan 21 2011
From Elmo R. Oliveira, Dec 25 2024: (Start)
E.g.f.: 3*exp(x)*x*(1 + 3*x).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n >= 3.
a(n) = n + A152995(n). (End)

A152773 3 times heptagonal numbers: a(n) = 3n(5*n-3)/2.

Original entry on oeis.org

0, 3, 21, 54, 102, 165, 243, 336, 444, 567, 705, 858, 1026, 1209, 1407, 1620, 1848, 2091, 2349, 2622, 2910, 3213, 3531, 3864, 4212, 4575, 4953, 5346, 5754, 6177, 6615, 7068, 7536, 8019, 8517, 9030, 9558, 10101, 10659, 11232, 11820, 12423, 13041, 13674, 14322, 14985

Offset: 0

Omar E. Pol, Dec 13 2008

Also the number of 6-cycles in the (n+5)-triangular honeycomb acute knight graph. - Eric W. Weisstein, Jun 25 2017

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

Cf. A000566, A001622, A135706, A226489.
3 times n-gonal numbers: A045943, A033428, A062741, A094159, A152751, A152759, A152767, A153783, A153448, A153875.
Cf. numbers of the form n*(n*k - k + 6)/2, this sequence is the case k=15: see Comments lines of A226492.
Cf. A002378 (3-cycles in triangular honeycomb acute knight graph), A045943 (4-cycles), A028896 (5-cycles).

Table[3 n (5 n - 3)/2, {n, 0, 50}] (* Harvey P. Dale, May 08 2012 *)
LinearRecurrence[{3, -3, 1}, {0, 3, 21}, 50] (* Harvey P. Dale, May 08 2012 *)
CoefficientList[Series[-((3 x^5 (1 + 4 x))/(-1 + x)^3), {x, 0, 20}], x] (* Eric W. Weisstein, Jun 25 2017 *)

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

a(n) = (15*n^2 - 9*n)/2 = 3*A000566(n).
a(n) = a(n-1) + 15*n - 12 with n > 0, a(0)=0. - Vincenzo Librandi, Nov 26 2010
G.f.: 3*x*(1+4*x)/(1-x)^3. - Bruno Berselli, Jan 21 2011
a(0)=0, a(1)=3, a(2)=21, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, May 08 2012
a(n) = n + A226489(n). - Bruno Berselli, Jun 11 2013
Sum_{n>=1} 1/a(n) = tan(Pi/10)*Pi/9 - sqrt(5)*log(phi)/9 + 5*log(5)/18, where phi is the golden ratio (A001622). - Amiram Eldar, May 20 2023
E.g.f.: 3*exp(x)*x*(2 + 5*x)/2. - Elmo R. Oliveira, Dec 24 2024

A152746 Six times hexagonal numbers: 6n(2*n-1).

Original entry on oeis.org

0, 6, 36, 90, 168, 270, 396, 546, 720, 918, 1140, 1386, 1656, 1950, 2268, 2610, 2976, 3366, 3780, 4218, 4680, 5166, 5676, 6210, 6768, 7350, 7956, 8586, 9240, 9918, 10620, 11346, 12096, 12870, 13668, 14490, 15336, 16206, 17100

Offset: 0

Omar E. Pol, Dec 12 2008

Sequence found by reading the line from 0, in the direction 0, 6, ..., in the square spiral whose vertices are the generalized octagonal numbers A001082. - Omar E. Pol, Sep 18 2011

a(n) is the number of walks on a cubic lattice of n dimensions that return to the origin, not necessarily for the first time, after 4 steps. - Shel Kaphan, Mar 20 2023

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

Cf. A000384, A001082, A002939, A094159, A085250, A152745.

Column n=2 of A287318.

[6*n*(2*n-1): n in [0..50]]; // G. C. Greubel, Sep 01 2018

6*PolygonalNumber[6,Range[0,40]] (* The program uses the PolygonalNumber function from Mathematica version 10 *) (* Harvey P. Dale, Mar 04 2016 *)
LinearRecurrence[{3,-3,1}, {0,6,36}, 50] (* or *) Table[6*n*(2*n-1), {n,0,50}] (* G. C. Greubel, Sep 01 2018 *)

a(n)=6*n*(2*n-1) \\ Charles R Greathouse IV, Jun 17 2017

a(n) = 12*n^2 - 6*n = A000384(n)*6 = A002939(n)*3 = A094159(n)*2.
a(n) = a(n-1) + 24*n - 18 (with a(0)=0). - Vincenzo Librandi, Nov 26 2010
From G. C. Greubel, Sep 01 2018: (Start)
G.f.: 6*x*(1+3*x)/(1-x)^3.
E.g.f.: 6*x*(1+2*x)*exp(x). (End)
From Amiram Eldar, Mar 30 2023: (Start)
Sum_{n>=1} 1/a(n) = log(2)/3.
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi/12 - log(2)/6. (End)

A226492 a(n) = n(11n-5)/2.

Original entry on oeis.org

0, 3, 17, 42, 78, 125, 183, 252, 332, 423, 525, 638, 762, 897, 1043, 1200, 1368, 1547, 1737, 1938, 2150, 2373, 2607, 2852, 3108, 3375, 3653, 3942, 4242, 4553, 4875, 5208, 5552, 5907, 6273, 6650, 7038, 7437, 7847, 8268, 8700, 9143, 9597, 10062, 10538, 11025, 11523

Offset: 0

Bruno Berselli, Jun 11 2013

Sequences of numbers of the form n*(n*k - k + 6)/2:
. k from 0 to 10, respectively: A008585, A055998, A005563, A045943, A014105, A005475, A033428, A022264, A033991, A062741, A147874;
. k=11: a(n);
. k=12: A094159;
. k=13: 0, 3, 19, 48, 90, 145, 213, 294, 388, 495, 615, 748, 894, ...;
. k=14: 0, 3, 20, 51, 96, 155, 228, 315, 416, 531, 660, 803, 960, ...;
. k=15: A152773;
. k=16: A139272;
. k=17: 0, 3, 23, 60, 114, 185, 273, 378, 500, 639, 795, 968, ...;
. k=18: A152751;
. k=19: 0, 3, 25, 66, 126, 205, 303, 420, 556, 711, 885, 1078, ...;
. k=20: 0, 3, 26, 69, 132, 215, 318, 441, 584, 747, 930, 1133, ...;
. k=21: A152759;
. k=22: 0, 3, 28, 75, 144, 235, 348, 483, 640, 819, 1020, 1243, ...;
. k=23: 0, 3, 29, 78, 150, 245, 363, 504, 668, 855, 1065, 1298, ...;
. k=24: A152767;
. k=25: 0, 3, 31, 84, 162, 265, 393, 546, 724, 927, 1155, 1408, ...;
. k=26: 0, 3, 32, 87, 168, 275, 408, 567, 752, 963, 1200, 1463, ...;
. k=27: A153783;
. k=28: A195021;
. k=29: 0, 3, 35, 96, 186, 305, 453, 630, 836, 1071, 1335, 1628, ...;
. k=30: A153448;
. k=31: 0, 3, 37, 102, 198, 325, 483, 672, 892, 1143, 1425, 1738, ...;
. k=32: 0, 3, 38, 105, 204, 335, 498, 693, 920, 1179, 1470, 1793, ...;
. k=33: A153875.
Also:
a(n) - n         = A180223(n);
a(n) + n         = n*(11*n-3)/2 = 0, 4, 19, 45, 82, 130, 189, 259, ...;
a(n) - 2*n       = A051865(n);
a(n) + 2*n       = A022268(n);
a(n) - 3*n       = A152740(n-1);
a(n) + 3*n       = A022269(n);
a(n) - 4*n       = n*(11*n-13)/2 = 0, -1, 9, 30, 62, 105, 159, 224, ...;
a(n) + 4*n       = A254963(n);
a(n) - n*(n-1)/2 = A147874(n+1);
a(n) + n*(n-1)/2 = A094159(n) (case k=12);
a(n) - n*(n-1)   = A062741(n) (see above, this is the case k=9);
a(n) + n*(n-1)   = n*(13*n-7)/2 (case k=13);
a(n) - n*(n+1)/2 = A135706(n);
a(n) + n*(n+1)/2 = A033579(n);
a(n) - n*(n+1)   = A051682(n);
a(n) + n*(n+1)   = A186030(n);
a(n) - n^2       = A062708(n);
a(n) + n^2       = n*(13*n-5)/2 = 0, 4, 21, 51, 94, 150, 219, ..., etc.
Sum of reciprocals of a(n), for n > 0: 0.47118857003113149692081665034891...

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

Cf. sequences in Comments lines.
First differences are in A017425.
Cf. A033584, A180223.

Magma
```
[n*(11*n-5)/2: n in [0..50]];
```

I:=[0,3,17]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+Self(n-3): n in [1..46]]; // Vincenzo Librandi, Aug 18 2013

Table[n (11 n - 5)/2, {n, 0, 50}]
CoefficientList[Series[x (3 + 8 x) / (1 - x)^3, {x, 0, 45}], x] (* Vincenzo Librandi, Aug 18 2013 *)
LinearRecurrence[{3,-3,1},{0,3,17},50] (* Harvey P. Dale, Jan 14 2019 *)

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

G.f.: x*(3+8*x)/(1-x)^3.
a(n) + a(-n) = A033584(n).
From Elmo R. Oliveira, Dec 27 2024: (Start)
E.g.f.: exp(x)*x*(6 + 11*x)/2.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2.
a(n) = n + A180223(n). (End)

A152759 3 times 9-gonal (or nonagonal) numbers: a(n) = 3n(7*n-5)/2.

Original entry on oeis.org

0, 3, 27, 72, 138, 225, 333, 462, 612, 783, 975, 1188, 1422, 1677, 1953, 2250, 2568, 2907, 3267, 3648, 4050, 4473, 4917, 5382, 5868, 6375, 6903, 7452, 8022, 8613, 9225, 9858, 10512, 11187, 11883, 12600, 13338, 14097, 14877, 15678, 16500, 17343, 18207, 19092, 19998

Offset: 0

Omar E. Pol, Dec 14 2008

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

Cf. A001106, A139268, A226491.
3 times n-gonal numbers: A045943, A033428, A062741, A094159, A152773, A152751, A152767, A153783, A153448, A153875.
Cf. numbers of the form n*(n*k-k+6)/2, this sequence is the case k=21: see Comments lines of A226492.

s=0;lst={s};Do[s+=n;AppendTo[lst,s],{n,3,6!,21}];lst (* Vladimir Joseph Stephan Orlovsky, Apr 02 2009 *)
CoefficientList[Series[3 x (1 + 6 x) / (1 - x)^3, {x, 0, 60}], x] (* Vincenzo Librandi, Jun 05 2013 *)
LinearRecurrence[{3,-3,1},{0,3,27},40] (* Harvey P. Dale, May 26 2015 *)

a(n)=3*n*(7*n-5)/2 \\ Charles R Greathouse IV, Sep 24 2015

a(n) = (21*n^2 - 15*n)/2 = 3*A001106(n).
a(n) = a(n-1) + 21*n - 18 with n > 0, a(0)=0. - Vincenzo Librandi, Nov 26 2010
G.f.: 3*x*(1+6*x)/(1-x)^3. - Bruno Berselli, Jan 21 2011
a(n) = n + A226491(n). - Bruno Berselli, Jun 11 2013
From Elmo R. Oliveira, Dec 15 2024: (Start)
E.g.f.: 3*exp(x)*x*(2 + 7*x)/2.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)

A152767 3 times 10-gonal (or decagonal) numbers: a(n) = 3n(4*n-3).

Original entry on oeis.org

0, 3, 30, 81, 156, 255, 378, 525, 696, 891, 1110, 1353, 1620, 1911, 2226, 2565, 2928, 3315, 3726, 4161, 4620, 5103, 5610, 6141, 6696, 7275, 7878, 8505, 9156, 9831, 10530, 11253, 12000, 12771, 13566, 14385, 15228, 16095, 16986, 17901, 18840, 19803, 20790, 21801

Offset: 0

Omar E. Pol, Dec 15 2008

3*A172078(n) = n*a(n) - Sum_{k=0..n-1} a(k). - Bruno Berselli, Dec 12 2010

			For n=8, a(8) = (1*3 + 5*7 + 9*11 +..+ 29*31) - (2*4 + 6*8 + 10*12 +..+ 26*28) = 696 (see Problem 1052 in References). - _Bruno Berselli_, Dec 12 2010

"Supplemento al Periodico di Matematica", Raffaello Giusti Editore (Livorno), Jan. 1910 p. 47 (Problem 1052).

Harvey P. Dale, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A001107, A001539, A002939, A139271, A153794, A172078.
3 times n-gonal numbers: A045943, A033428, A062741, A094159, A152773, A152751, A152759, A153783, A153448, A153875.
Cf. numbers of the form n*(n*k - k + 6)/2, this sequence is the case k=24: see Comments lines of A226492.

Table[3n(4n-3),{n,0,40}] (* Harvey P. Dale, May 26 2012 *)

a(n)=3*n*(4*n-3) \\ Charles R Greathouse IV, Sep 28 2015

a(n) = 12*n^2 - 9*n = 3*A001107(n).
a(n) = a(n-1) + 24*n - 21, n > 0. - Vincenzo Librandi, Nov 26 2010
a(n) = Sum_{k=0..n-1} A001539(k) - Sum_{k=0..n-1} 4*A002939(k) if n > 0 (see References, Problem 1052). - Bruno Berselli, Dec 08 2010 - Jan 21 2011
G.f.: -3*x*(1+7*x)/(x-1)^3.
a(0)=0, a(1)=3, a(2)=30, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, May 26 2012
From Elmo R. Oliveira, Dec 15 2024: (Start)
E.g.f.: 3*exp(x)*x*(1 + 4*x).
a(n) = A153794(n) - n. (End)

A153448 3 times 12-gonal (or dodecagonal) numbers: a(n) = 3n(5*n-4).

Original entry on oeis.org

0, 3, 36, 99, 192, 315, 468, 651, 864, 1107, 1380, 1683, 2016, 2379, 2772, 3195, 3648, 4131, 4644, 5187, 5760, 6363, 6996, 7659, 8352, 9075, 9828, 10611, 11424, 12267, 13140, 14043, 14976, 15939, 16932, 17955, 19008, 20091, 21204

Offset: 0

Omar E. Pol, Dec 26 2008

This sequence is related to A172117 by 3*A172117(n) = n*a(n) - Sum_{i=0..n-1} a(i) and this is the case d=10 in the identity n*(3*n*(d*n - d + 2)/2) - Sum_{k=0..n-1} 3*k*(d*k - d + 2)/2 = n*(n+1)*(2*d*n - 2*d + 3)/2. - Bruno Berselli, Aug 26 2010

G. C. Greubel, Table of n, a(n) for n = 0..1000
B. Berselli, A description of the recursive method in Comments lines: website Matem@ticamente (in Italian).
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A051624, A152965.
3 times n-gonal numbers: A045943, A033428, A062741, A094159, A152773, A152751, A152759, A152767, A153783, A153875, A172117.
Cf. numbers of the form n*(n*k-k+6)/2, this sequence is the case k=30: see Comments lines of A226492.

Table[3n(5n-4),{n,0,40}] (* or *) LinearRecurrence[{3,-3,1},{0,3,36},40] (* Harvey P. Dale, Jun 18 2014 *)
3*PolygonalNumber[12,Range[0,60]] (* Harvey P. Dale, May 13 2022 *)

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

a(n) = 15*n^2 - 12*n = A051624(n)*3.
a(n) = 30*n + a(n-1) - 27 with n>0, a(0)=0. - Vincenzo Librandi, Aug 03 2010
G.f.: 3*x*(1 + 9*x)/(1-x)^3. - Bruno Berselli, Jan 21 2011
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3); a(0)=0, a(1)=3, a(2)=36. - Harvey P. Dale, Jun 18 2014
E.g.f.: 3*x*(1 + 5*x)*exp(x). - G. C. Greubel, Aug 21 2016
a(n) = (4*n-2)^2 - (n-2)^2. In general, if P(k,n) is the k-th n-gonal number, then (2*k+1)*P(8*k+4,n) = ((3*k+1)*n-2*k)^2 - (k*n-2*k)^2. - Charlie Marion, Jul 29 2021

cp's OEIS Frontend

A045943 Triangular matchstick numbers: a(n) = 3*n*(n+1)/2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Scala

Formula

A033428 a(n) = 3*n^2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

Maxima

PARI

Python

Formula

Extensions

A062741 3 times pentagonal numbers: 3*n*(3*n-1)/2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

SageMath

Formula

Extensions

A152751 3 times octagonal numbers: a(n) = 3*n*(3*n-2).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A152773 3 times heptagonal numbers: a(n) = 3*n*(5*n-3)/2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A152746 Six times hexagonal numbers: 6*n*(2*n-1).

Views

Author

Keywords

A045943 Triangular matchstick numbers: a(n) = 3n(n+1)/2.

A062741 3 times pentagonal numbers: 3n(3*n-1)/2.

A152751 3 times octagonal numbers: a(n) = 3n(3*n-2).

A152773 3 times heptagonal numbers: a(n) = 3n(5*n-3)/2.

A152746 Six times hexagonal numbers: 6n(2*n-1).

A226492 a(n) = n(11n-5)/2.

A152759 3 times 9-gonal (or nonagonal) numbers: a(n) = 3n(7*n-5)/2.

A152767 3 times 10-gonal (or decagonal) numbers: a(n) = 3n(4*n-3).

A153448 3 times 12-gonal (or dodecagonal) numbers: a(n) = 3n(5*n-4).