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-10 of 23 results. Next

A000326 Pentagonal numbers: a(n) = n*(3*n-1)/2.

Original entry on oeis.org

0, 1, 5, 12, 22, 35, 51, 70, 92, 117, 145, 176, 210, 247, 287, 330, 376, 425, 477, 532, 590, 651, 715, 782, 852, 925, 1001, 1080, 1162, 1247, 1335, 1426, 1520, 1617, 1717, 1820, 1926, 2035, 2147, 2262, 2380, 2501, 2625, 2752, 2882, 3015, 3151
Offset: 0

Views

Author

Keywords

Comments

The average of the first n (n > 0) pentagonal numbers is the n-th triangular number. - Mario Catalani (mario.catalani(AT)unito.it), Apr 10 2003
a(n) is the sum of n integers starting from n, i.e., 1, 2 + 3, 3 + 4 + 5, 4 + 5 + 6 + 7, etc. - Jon Perry, Jan 15 2004
Partial sums of 1, 4, 7, 10, 13, 16, ... (1 mod 3), a(2k) = k(6k-1), a(2k-1) = (2k-1)(3k-2). - Jon Perry, Sep 10 2004
Starting with offset 1 = binomial transform of [1, 4, 3, 0, 0, 0, ...]. Also, A004736 * [1, 3, 3, 3, ...]. - Gary W. Adamson, Oct 25 2007
If Y is a 3-subset of an n-set X then, for n >= 4, a(n-3) is the number of 4-subsets of X having at least two elements in common with Y. - Milan Janjic, Nov 23 2007
Solutions to the duplication formula 2*a(n) = a(k) are given by the index pairs (n, k) = (5,7), (5577, 7887), (6435661, 9101399), etc. The indices are integer solutions to the pair of equations 2(6n-1)^2 = 1 + y^2, k = (1+y)/6, so these n can be generated from the subset of numbers [1+A001653(i)]/6, any i, where these are integers, confined to the cases where the associated k=[1+A002315(i)]/6 are also integers. - R. J. Mathar, Feb 01 2008
a(n) is a binomial coefficient C(n,4) (A000332) if and only if n is a generalized pentagonal number (A001318). Also see A145920. - Matthew Vandermast, Oct 28 2008
Even octagonal numbers divided by 8. - Omar E. Pol, Aug 18 2011
Sequence found by reading the line from 0, in the direction 0, 5, ... and the line from 1, in the direction 1, 12, ..., in the square spiral whose vertices are the generalized pentagonal numbers A001318. - Omar E. Pol, Sep 08 2011
The hyper-Wiener index of the star-tree with n edges (see A196060, example). - Emeric Deutsch, Sep 30 2011
More generally the n-th k-gonal number is equal to n + (k-2)*A000217(n-1), n >= 1, k >= 3. In this case k = 5. - Omar E. Pol, Apr 06 2013
Note that both Euler's pentagonal theorem for the partition numbers and Euler's pentagonal theorem for the sum of divisors refer more exactly to the generalized pentagonal numbers, not this sequence. For more information see A001318, A175003, A238442. - Omar E. Pol, Mar 01 2014
The Fuss-Catalan numbers are Cat(d,k)= [1/(k*(d-1)+1)]*binomial(k*d,k) and enumerate the number of (d+1)-gon partitions of a (k*(d-1)+2)-gon (cf. Schuetz and Whieldon link). a(n)= Cat(n,3), so enumerates the number of (n+1)-gon partitions of a (3*(n-1)+2)-gon. Analogous sequences are A100157 (k=4) and A234043 (k=5). - Tom Copeland, Oct 05 2014
Binomial transform of (0, 1, 3, 0, 0, 0, ...) (A169585 with offset 1) and second partial sum of (0, 1, 3, 3, 3, ...). - Gary W. Adamson, Oct 05 2015
For n > 0, a(n) is the number of compositions of n+8 into n parts avoiding parts 2 and 3. - Milan Janjic, Jan 07 2016
a(n) is also the number of edges in the Mycielskian of the complete graph K[n]. Indeed, K[n] has n vertices and n(n-1)/2 edges. Then its Mycielskian has n + 3n(n-1)/2 = n(3n-1)/2. See p. 205 of the West reference. - Emeric Deutsch, Nov 04 2016
Sum of the numbers from n to 2n-1. - Wesley Ivan Hurt, Dec 03 2016
Also the number of maximal cliques in the n-Andrásfai graph. - Eric W. Weisstein, Dec 01 2017
Coefficients in the hypergeometric series identity 1 - 5*(x - 1)/(2*x + 1) + 12*(x - 1)*(x - 2)/((2*x + 1)*(2*x + 2)) - 22*(x - 1)*(x - 2)*(x - 3)/((2*x + 1)*(2*x + 2)*(2*x + 3)) + ... = 0, valid for Re(x) > 1. Cf. A002412 and A002418. Column 2 of A103450. - Peter Bala, Mar 14 2019
A generalization of the Comment dated Apr 10 2003 follows. (k-3)*A000292(n-2) plus the average of the first n (2k-1)-gonal numbers is the n-th k-gonal number. - Charlie Marion, Nov 01 2020
a(n+1) is the number of Dyck paths of size (3,3n+1); i.e., the number of NE lattice paths from (0,0) to (3,3n+1) which stay above the line connecting these points. - Harry Richman, Jul 13 2021
a(n) is the largest sum of n positive integers x_1, ..., x_n such that x_i | x_(i+1)+1 for each 1 <= i <= n, where x_(n+1) = x_1. - Yifan Xie, Feb 21 2025

Examples

			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
.
.  1    5     12       22           35
- _Philippe Deléham_, Mar 30 2013
		

References

  • Tom M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, pages 2 and 311.
  • Raymond Ayoub, An Introduction to the Analytic Theory of Numbers, Amer. Math. Soc., 1963; p. 129.
  • Albert H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 189.
  • John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See pp. 38, 40.
  • E. Deza and M. M. Deza, Figurate numbers, World Scientific Publishing (2012), page 6.
  • L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923, see vol. 2, p. 1.
  • Jan Gullberg, Mathematics from the Birth of Numbers, W. W. Norton & Co., NY & London, 1997, §8.6 Figurate Numbers, p. 291.
  • G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed., Oxford Univ. Press, 1954, p. 284.
  • Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see p. 64.
  • Alfred S. Posamentier, Math Charmers, Tantalizing Tidbits for the Mind, Prometheus Books, NY, 2003, pages 52-53, 129-130, 132.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, pages 7-10.
  • André Weil, Number theory: an approach through history; from Hammurapi to Legendre, Birkhäuser, Boston, 1984; see p. 186.
  • David Wells, The Penguin Dictionary of Curious and Interesting Numbers, Penguin Books, 1987, pp. 98-100.
  • Douglas B. West, Introduction to Graph Theory, 2nd ed., Prentice-Hall, NJ, 2001.

Crossrefs

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.
Cf. A001318 (generalized pentagonal numbers), A049452, A033570, A010815, A034856, A051340, A004736, A033568, A049453, A002411 (partial sums), A033579.
See A220083 for a list of numbers of the form n*P(s,n)-(n-1)*P(s,n-1), where P(s,n) is the n-th polygonal number with s sides.
Cf. A240137: sum of n consecutive cubes starting from n^3.
Cf. similar sequences listed in A022288.
Partial sums of A016777.

Programs

  • GAP
    List([0..50],n->n*(3*n-1)/2); # Muniru A Asiru, Mar 18 2019
    
  • Haskell
    a000326 n = n * (3 * n - 1) `div` 2  -- Reinhard Zumkeller, Jul 07 2012
    
  • Magma
    [n*(3*n-1)/2 : n in [0..100]]; // Wesley Ivan Hurt, Oct 15 2015
    
  • Maple
    A000326 := n->n*(3*n-1)/2: seq(A000326(n), n=0..100);
    A000326:=-(1+2*z)/(z-1)**3; # Simon Plouffe in his 1992 dissertation
    a[0]:=0:a[1]:=1:for n from 2 to 50 do a[n]:=2*a[n-1]-a[n-2]+3 od: seq(a[n], n=0..50); # Miklos Kristof, Zerinvary Lajos, Feb 18 2008
  • Mathematica
    Table[n (3 n - 1)/2, {n, 0, 60}] (* Stefan Steinerberger, Apr 01 2006 *)
    Array[# (3 # - 1)/2 &, 47, 0] (* Zerinvary Lajos, Jul 10 2009 *)
    LinearRecurrence[{3, -3, 1}, {0, 1, 5}, 61] (* Harvey P. Dale, Dec 27 2011 *)
    pentQ[n_] := IntegerQ[(1 + Sqrt[24 n + 1])/6]; pentQ[0] = True; Select[Range[0, 3200], pentQ@# &] (* Robert G. Wilson v, Mar 31 2014 *)
    Join[{0}, Accumulate[Range[1, 312, 3]]] (* Harvey P. Dale, Mar 26 2016 *)
    (* For Mathematica 10.4+ *) Table[PolygonalNumber[RegularPolygon[5], n], {n, 0, 46}] (* Arkadiusz Wesolowski, Aug 27 2016 *)
    CoefficientList[Series[x (-1 - 2 x)/(-1 + x)^3, {x, 0, 20}], x] (* Eric W. Weisstein, Dec 01 2017 *)
    PolygonalNumber[5, Range[0, 20]] (* Eric W. Weisstein, Dec 01 2017 *)
  • PARI
    a(n)=n*(3*n-1)/2
    
  • PARI
    vector(100, n, n--; binomial(3*n, 2)/3) \\ Altug Alkan, Oct 06 2015
    
  • PARI
    is_a000326(n) = my(s); n==0 || (issquare (24*n+1, &s) && s%6==5); \\ Hugo Pfoertner, Aug 03 2023
    
  • Python
    # Intended to compute the initial segment of the sequence, not isolated terms.
    def aList():
         x, y = 1, 1
         yield 0
         while True:
             yield x
             x, y = x + y + 3, y + 3
    A000326 = aList()
    print([next(A000326) for i in range(47)]) # Peter Luschny, Aug 04 2019

Formula

Product_{m > 0} (1 - q^m) = Sum_{k} (-1)^k*x^a(k). - Paul Barry, Jul 20 2003
G.f.: x*(1+2*x)/(1-x)^3.
E.g.f.: exp(x)*(x+3*x^2/2).
a(n) = n*(3*n-1)/2.
a(-n) = A005449(n).
a(n) = binomial(3*n, 2)/3. - Paul Barry, Jul 20 2003
a(n) = A000290(n) + A000217(n-1). - Lekraj Beedassy, Jun 07 2004
a(0) = 0, a(1) = 1; for n >= 2, a(n) = 2*a(n-1) - a(n-2) + 3. - Miklos Kristof, Mar 09 2005
a(n) = Sum_{k=1..n} (2*n - k). - Paul Barry, Aug 19 2005
a(n) = 3*A000217(n) - 2*n. - Lekraj Beedassy, Sep 26 2006
a(n) = A126890(n, n-1) for n > 0. - Reinhard Zumkeller, Dec 30 2006
a(n) = A049452(n) - A022266(n) = A033991(n) - A005476(n). - Zerinvary Lajos, Jun 12 2007
Equals A034856(n) + (n - 1)^2. Also equals A051340 * [1,2,3,...]. - Gary W. Adamson, Jul 27 2007
a(n) = binomial(n+1, 2) + 2*binomial(n, 2).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3), a(0) = 0, a(1) = 1, a(2) = 5. - Jaume Oliver Lafont, Dec 02 2008
a(n) = a(n-1) + 3*n-2 with n > 0, a(0)=0. - Vincenzo Librandi, Nov 20 2010
a(n) = A000217(n) + 2*A000217(n-1). - Vincenzo Librandi, Nov 20 2010
a(n) = A014642(n)/8. - Omar E. Pol, Aug 18 2011
a(n) = A142150(n) + A191967(n). - Reinhard Zumkeller, Jul 07 2012
a(n) = (A000290(n) + A000384(n))/2 = (A000217(n) + A000566(n))/2 = A049450(n)/2. - Omar E. Pol, Jan 11 2013
a(n) = n*A000217(n) - (n-1)*A000217(n-1). - Bruno Berselli, Jan 18 2013
a(n) = A005449(n) - n. - Philippe Deléham, Mar 30 2013
From Oskar Wieland, Apr 10 2013: (Start)
a(n) = a(n+1) - A016777(n),
a(n) = a(n+2) - A016969(n),
a(n) = a(n+3) - A016777(n)*3 = a(n+3) - A017197(n),
a(n) = a(n+4) - A016969(n)*2 = a(n+4) - A017641(n),
a(n) = a(n+5) - A016777(n)*5,
a(n) = a(n+6) - A016969(n)*3,
a(n) = a(n+7) - A016777(n)*7,
a(n) = a(n+8) - A016969(n)*4,
a(n) = a(n+9) - A016777(n)*9. (End)
a(n) = A000217(2n-1) - A000217(n-1), for n > 0. - Ivan N. Ianakiev, Apr 17 2013
a(n) = A002411(n) - A002411(n-1). - J. M. Bergot, Jun 12 2013
Sum_{n>=1} a(n)/n! = 2.5*exp(1). - Richard R. Forberg, Jul 15 2013
a(n) = floor(n/(exp(2/(3*n)) - 1)), for n > 0. - Richard R. Forberg, Jul 27 2013
From Vladimir Shevelev, Jan 24 2014: (Start)
a(3*a(n) + 4*n + 1) = a(3*a(n) + 4*n) + a(3*n+1).
A generalization. Let {G_k(n)}_(n >= 0) be sequence of k-gonal numbers (k >= 3). Then the following identity holds: G_k((k-2)*G_k(n) + c(k-3)*n + 1) = G_k((k-2)*G_k(n) + c(k-3)*n) + G_k((k-2)*n + 1), where c = A000124. (End)
A242357(a(n)) = 1 for n > 0. - Reinhard Zumkeller, May 11 2014
Sum_{n>=1} 1/a(n)= (1/3)*(9*log(3) - sqrt(3)*Pi). - Enrique Pérez Herrero, Dec 02 2014. See the decimal expansion A244641.
a(n) = (A000292(6*n+k-1)-A000292(k))/(6*n-1)-A000217(3*n+k), for any k >= 0. - Manfred Arens, Apr 26 2015 [minor edits from Wolfdieter Lang, May 10 2015]
a(n) = A258708(3*n-1,1) for n > 0. - Reinhard Zumkeller, Jun 23 2015
a(n) = A007584(n) - A245301(n-1), for n > 0. - Manfred Arens, Jan 31 2016
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*(sqrt(3)*Pi - 6*log(2))/3 = 0.85501000622865446... - Ilya Gutkovskiy, Jul 28 2016
a(m+n) = a(m) + a(n) + 3*m*n. - Etienne Dupuis, Feb 16 2017
In general, let P(k,n) be the n-th k-gonal number. Then P(k,m+n) = P(k,m) + (k-2)mn + P(k,n). - Charlie Marion, Apr 16 2017
a(n) = A023855(2*n-1) - A023855(2*n-2). - Luc Rousseau, Feb 24 2018
a(n) = binomial(n,2) + n^2. - Pedro Caceres, Jul 28 2019
Product_{n>=2} (1 - 1/a(n)) = 3/5. - Amiram Eldar, Jan 21 2021
(n+1)*(a(n^2) + a(n^2+1) + ... + a(n^2+n)) = n*(a(n^2+n+1) + ... + a(n^2+2n)). - Charlie Marion, Apr 28 2024
a(n) = Sum_{k = 0..3*n} (-1)^(n+k+1) * binomial(k, 2)*binomial(3*n+k-1, 2*k). - Peter Bala, Nov 04 2024

Extensions

Incorrect example removed by Joerg Arndt, Mar 11 2010

A049450 Pentagonal numbers multiplied by 2: a(n) = n*(3*n-1).

Original entry on oeis.org

0, 2, 10, 24, 44, 70, 102, 140, 184, 234, 290, 352, 420, 494, 574, 660, 752, 850, 954, 1064, 1180, 1302, 1430, 1564, 1704, 1850, 2002, 2160, 2324, 2494, 2670, 2852, 3040, 3234, 3434, 3640, 3852, 4070, 4294, 4524, 4760, 5002, 5250, 5504, 5764
Offset: 0

Views

Author

Joe Keane (jgk(AT)jgk.org)

Keywords

Comments

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,2,.... The spiral begins:
.
56--55--54--53--52
/ \
57 33--32--31--30 51
/ / \ \
58 34 16--15--14 29 50
/ / / \ \ \
59 35 17 5---4 13 28 49
/ / / / \ \ \ \
60 36 18 6 0 3 12 27 48
/ / / / / . / / / /
61 37 19 7 1---2 11 26 47
\ \ \ \ . / / /
62 38 20 8---9--10 25 46
\ \ \ . / /
63 39 21--22--23--24 45
\ \ . /
64 40--41--42--43--44
\ .
65--66--67--68--69--70
(End)
Starting with offset 1 = binomial transform of [2, 8, 6, 0, 0, 0, ...]. - Gary W. Adamson, Jan 09 2009
Number of possible pawn moves on an (n+1) X (n+1) chessboard (n=>3). - Johannes W. Meijer, Feb 04 2010
a(n) = A069905(6n-1): Number of partitions of 6*n-1 into 3 parts. - Adi Dani, Jun 04 2011
Even octagonal numbers divided by 4. - Omar E. Pol, Aug 19 2011
Partial sums give A011379. - Omar E. Pol, Jan 12 2013
First differences are A016933; second differences equal 6. - Bob Selcoe, Apr 02 2015
For n >= 1, the continued fraction expansion of sqrt(27*a(n)) is [9n-2; {2, 2n-1, 6, 2n-1, 2, 18n-4}]. - Magus K. Chu, Oct 13 2022

Examples

			On a 4 X 4 chessboard pawns at the second row have (3+4+4+3) moves and pawns at the third row have (2+3+3+2) moves so a(3) = 24. - _Johannes W. Meijer_, Feb 04 2010
From _Adi Dani_, Jun 04 2011: (Start)
a(1)=2: the partitions of 6*1-1=5 into 3 parts are [1,1,3] and[1,2,2].
a(2)=10: the partitions of 6*2-1=11 into 3 parts are [1,1,9], [1,2,8], [1,3,7], [1,4,6], [1,5,5], [2,2,7], [2,3,6], [2,4,5], [3,3,5], and [3,4,4].
(End)
.
.                                                         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 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
.    2      10         24             44                 70
- _Philippe Deléham_, Mar 30 2013
		

Crossrefs

Cf. A000567.
Bisection of A001859. Cf. A045944, A000326, A033579, A027599, A049451.
Cf. A033586 (King), A035005 (Queen), A035006 (Rook), A035008 (Knight) and A002492 (Bishop).
Cf. numbers of the form n*(n*k-k+4)/2 listed in A226488. [Bruno Berselli, Jun 10 2013]
Cf. sequences listed in A254963.

Programs

  • GAP
    List([0..50], n-> n*(3*n-1)); # G. C. Greubel, Aug 31 2019
  • Magma
    [n*(3*n-1) : n in [0..50]]; // Wesley Ivan Hurt, Sep 24 2017
    
  • Maple
    seq(n*(3*n-1),n=0..44); # Zerinvary Lajos, Jun 12 2007
  • Mathematica
    Table[n(3n-1),{n,0,50}] (* or *) LinearRecurrence[{3,-3,1},{0,2,10},50] (* Harvey P. Dale, Jun 21 2014 *)
    2*PolygonalNumber[5,Range[0,50]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jun 01 2018 *)
  • PARI
    a(n)=n*(3*n-1) \\ Charles R Greathouse IV, Nov 20 2012
    
  • Sage
    [n*(3*n-1) for n in (0..50)] # G. C. Greubel, Aug 31 2019
    

Formula

O.g.f.: A(x) = 2*x*(1+2*x)/(1-x)^3.
a(n) = A049452(n) - A033428(n). - Zerinvary Lajos, Jun 12 2007
a(n) = 2*A000326(n), twice pentagonal numbers. - Omar E. Pol, May 14 2008
a(n) = A022264(n) - A000217(n). - Reinhard Zumkeller, Oct 09 2008
a(n) = a(n-1) + 6*n - 4 (with a(0)=0). - Vincenzo Librandi, Aug 06 2010
a(n) = A014642(n)/4 = A033579(n)/2. - Omar E. Pol, Aug 19 2011
a(n) = A000290(n) + A000384(n) = A000217(n) + A000566(n). - Omar E. Pol, Jan 11 2013
a(n+1) = A014107(n+2) + A000290(n). - Philippe Deléham, Mar 30 2013
E.g.f.: x*(2 + 3*x)*exp(x). - Vincenzo Librandi, Apr 28 2016
a(n) = (2/3)*A000217(3*n-1). - Bruno Berselli, Feb 13 2017
a(n) = A002061(n) + A056220(n). - Bruce J. Nicholson, Sep 21 2017
From Amiram Eldar, Feb 20 2022: (Start)
Sum_{n>=1} 1/a(n) = 3*log(3)/2 - Pi/(2*sqrt(3)).
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi/sqrt(3) - 2*log(2). (End)
From Leo Tavares, Feb 23 2022: (Start)
a(n) = A003215(n) - A016813(n).
a(n) = 2*A000290(n) + 2*A000217(n-1). (End)

A062717 Numbers m such that 6*m+1 is a perfect square.

Original entry on oeis.org

0, 4, 8, 20, 28, 48, 60, 88, 104, 140, 160, 204, 228, 280, 308, 368, 400, 468, 504, 580, 620, 704, 748, 840, 888, 988, 1040, 1148, 1204, 1320, 1380, 1504, 1568, 1700, 1768, 1908, 1980, 2128, 2204, 2360, 2440, 2604, 2688, 2860, 2948, 3128, 3220, 3408, 3504
Offset: 1

Views

Author

Jason Earls, Jul 14 2001

Keywords

Comments

X values of solutions to the equation 6*X^3 + X^2 = Y^2. - Mohamed Bouhamida, Nov 06 2007
Arithmetic averages of the k triangular numbers 0, 1, 3, 6, ..., (k-1)*k/2 that take integer values. - Vladimir Joseph Stephan Orlovsky, Aug 05 2009 [edited by Jon E. Schoenfield, Jan 10 2015]
Even terms in A186423; union of A033579 and A033580, A010052(6*a(n)+1) = 1. - Reinhard Zumkeller, Feb 21 2011
a(n) are integers produced by Sum_{i = 1..k-1} i*(k-i)/k, for some k > 0. Values for k are given by A007310 = sqrt(6*a(n)+1), the square roots of those perfect squares. - Richard R. Forberg, Feb 16 2015
Equivalently, numbers of the form 2*h*(3*h+1), where h = 0, -1, 1, -2, 2, -3, 3, -4, 4, ... (see also the sixth comment of A152749). - Bruno Berselli, Feb 02 2017

Crossrefs

Equals 4 * A001318.
Cf. A007310.
Diagonal of array A323674. - Sally Myers Moite, Feb 03 2019

Programs

  • Magma
    [(6*n*(n-1) + (2*n-1)*(-1)^n + 1)/4: n in [1..70]]; // Wesley Ivan Hurt, Apr 21 2021
    
  • Maple
    seq(n^2+n+2*ceil(n/2)^2,n=0..48); # Gary Detlefs, Feb 23 2010
  • Mathematica
    Select[Range[0, 3999], IntegerQ[Sqrt[6# + 1]] &] (* Harvey P. Dale, Mar 10 2013 *)
  • PARI
    je=[]; for(n=0,7000, if(issquare(6*n+1),je=concat(je,n))); je
    
  • PARI
    { n=0; for (m=0, 10^9, if (issquare(6*m + 1), write("b062717.txt", n++, " ", m); if (n==1000, break)) ) } \\ Harry J. Smith, Aug 09 2009
    
  • Python
    def A062717(n): return (n*(3*n + 4) + 1 if n&1 else n*(3*n + 2))>>1 # Chai Wah Wu, Jan 31 2023

Formula

G.f.: 4*x^2*(1 + x + x^2) / ( (1+x)^2*(1-x)^3 ).
a(2*k) = k*(6*k+2), a(2*k+1) = 6*k^2 + 10*k + 4. - Mohamed Bouhamida, Nov 06 2007
a(n) = n^2 - n + 2*ceiling((n-1)/2)^2. - Gary Detlefs, Feb 23 2010
From Bruno Berselli, Nov 28 2010: (Start)
a(n) = (6*n*(n-1) + (2*n-1)*(-1)^n + 1)/4.
6*a(n) + 1 = A007310(n)^2. (End)
E.g.f.: (3*x^2*exp(x) - x*exp(-x) + sinh(x))/2. - Ilya Gutkovskiy, Jun 18 2016
a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5). - Wesley Ivan Hurt, Apr 21 2021
From Amiram Eldar, Mar 11 2022: (Start)
Sum_{n>=2} 1/a(n) = (9-sqrt(3)*Pi)/6.
Sum_{n>=2} (-1)^n/a(n) = 3*(log(3)-1)/2. (End)

A067611 Numbers of the form 6xy +- x +- y, where x, y are positive integers.

Original entry on oeis.org

4, 6, 8, 9, 11, 13, 14, 15, 16, 19, 20, 21, 22, 24, 26, 27, 28, 29, 31, 34, 35, 36, 37, 39, 41, 42, 43, 44, 46, 48, 49, 50, 51, 53, 54, 55, 56, 57, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 71, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 88, 89, 90, 91, 92, 93, 94
Offset: 1

Views

Author

Jon Perry, Feb 01 2002

Keywords

Comments

Equivalently, numbers n such that either 6n-1 or 6n+1 is composite (or both are).
Numbers k such that 36*k^2 - 1 is not a product of twin primes. - Artur Jasinski, Dec 12 2007
Apart from initial zero, union of A046953 and A046954. - Reinhard Zumkeller, Jul 13 2014
From Bob Selcoe, Nov 18 2014: (Start)
Complementary sequence to A002822.
For all k >= 1, a(n) are the only positive numbers congruent to the following residue classes:
f == k (mod 6k+-1);
g == (5k-1) (mod 6k-1);
h == (5k+1) (mod 6k+1).
All numbers in classes g and h will be in this sequence; for class f, the quotient must be >= 1.
When determining which numbers are contained in this sequence, it is only necessary to evaluate f, g and h when the moduli are prime and the dividends are >= 2*k*(3*k - 1) (i.e., A033579(k)).
(End)
From Jason Kimberley, Oct 14 2015: (Start)
Numbers n such that A001222(A136017(n)) > 2.
The disjoint union of A060461, A121763, and A121765.
(End)
From Ralf Steiner, Aug 08 2018 (Start)
Conjecture 1: With u(k) = floor(k(k + 1)/4) one has A071538(a(u(k))*6) = a(u(k)) - u(k) + 1, for k >= 2 (u > 1).
Conjecture 2: In the interval [T(k-1)+1, T(k)], with T(k) = A000217(k), k >= 2, there exists at least one number that is not a member of the present sequence. (End)
Also: numbers of the form n*p +- round(p/6) with some positive integer n and prime p >= 5. [Proof available on demand.] - M. F. Hasler, Jun 25 2019

Examples

			4 = 6ab - a - b with a = 1, b = 1.
6 = 6ab + a - b or 6ab - a + b with a = 1, b = 1.
5 cannot be obtained by any values of a and b in 6ab - a - b, 6ab - a + b, 6ab + a - b or 6ab + a + b.
		

Crossrefs

Cf. A323674 (numbers 6xy +- x +- y including repetitions). - Sally Myers Moite, Jan 27 2019

Programs

  • GAP
    Filtered([1..120], k-> not IsPrime(6*k-1) or not IsPrime(6*k+1)) # G. C. Greubel, Feb 21 2019
  • Haskell
    a067611 n = a067611_list !! (n-1)
    a067611_list = map (`div` 6) $
       filter (\x -> a010051' (x-1) == 0 || a010051' (x+1) == 0) [6,12..]
    -- Reinhard Zumkeller, Jul 13 2014
    
  • Magma
    [n: n in [1..100] | not IsPrime(6*n-1) or not IsPrime(6*n+1)]; // Vincenzo Librandi, Nov 19 2014
    
  • Maple
    filter:= n -> not isprime(6*n+1) or not isprime(6*n-1):
    select(filter, [$1..1000]); # Robert Israel, Nov 18 2014
  • Mathematica
    Select[Range[100], !PrimeQ[6# - 1] || !PrimeQ[6# + 1] &]
    Select[Range[100],AnyTrue[6#+{1,-1},CompositeQ]&] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Oct 05 2019 *)
  • PARI
    for(n=1, 1e2, if(!isprime(6*n+1) || !isprime(6*n-1), print1(n", "))) \\ Altug Alkan, Nov 10 2015
    
  • Sage
    [n for n in (1..120) if not is_prime(6*n-1) or not is_prime(6*n+1)] # G. C. Greubel, Feb 21 2019
    

Extensions

Edited by Robert G. Wilson v, Feb 05 2002
Edited by Dean Hickerson, May 07 2002

A014642 Even octagonal numbers: a(n) = 4*n*(3*n-1).

Original entry on oeis.org

0, 8, 40, 96, 176, 280, 408, 560, 736, 936, 1160, 1408, 1680, 1976, 2296, 2640, 3008, 3400, 3816, 4256, 4720, 5208, 5720, 6256, 6816, 7400, 8008, 8640, 9296, 9976, 10680, 11408, 12160, 12936, 13736, 14560, 15408, 16280, 17176, 18096, 19040, 20008, 21000, 22016
Offset: 0

Views

Author

Keywords

Comments

8 times pentagonal numbers. - Omar E. Pol, Dec 11 2008
Sequence found by reading the line from 0, in the direction 0, 8, ..., in the square spiral whose vertices are the generalized octagonal numbers A001082. - Omar E. Pol, Jul 18 2012
The sequence forms the even nesting cube-frames (see illustrations in A000567), which separate and appear according to formula along the axes on the zero-centered and one-centered hexagonal number spirals, as well as the axes of the zero-centered and one-centered square number spirals. See illustrations in links. - John Elias, Jul 20 2022

Crossrefs

Programs

  • GAP
    List([0..50], n-> 8*Binomial(3*n,2)/3); # G. C. Greubel, Oct 09 2019
  • Magma
    [8*Binomial(3*n,2)/3: n in [0..50]]; // G. C. Greubel, Oct 09 2019
    
  • Maple
    seq(8*binomial(3*n,2)/3, n=0..50); # G. C. Greubel, Oct 09 2019
  • Mathematica
    LinearRecurrence[{3,-3,1},{0,8,40}, 50] (* G. C. Greubel, Jun 07 2017 *)
    PolygonalNumber[8,Range[0,90,2]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Aug 19 2020 *)
  • PARI
    vector(51, n, 8*binomial(3*(n-1),2)/3 ) \\ G. C. Greubel, Jun 07 2017
    
  • Sage
    [8*binomial(3*n,2)/3 for n in (0..50)] # G. C. Greubel, Oct 09 2019
    

Formula

a(n) = A000326(n)*8. - Omar E. Pol, Dec 11 2008
a(n) = A049450(n)*4 = A033579(n)*2. - Omar E. Pol, Dec 13 2008
a(n) = a(n-1) + 24*n - 16 (with a(0)=0). - Vincenzo Librandi, Nov 20 2010
G.f.: x*(8+16*x)/(1-3*x+3*x^2-x^3). - Colin Barker, Jan 06 2012
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - G. C. Greubel, Jun 07 2017
E.g.f.: 4*x*(2 + 3*x)*exp(x). - G. C. Greubel, Oct 09 2019
From Amiram Eldar, Mar 24 2021: (Start)
Sum_{n>=1} 1/a(n) = 3*log(3)/8 - Pi/(8*sqrt(3)).
Sum_{n>=1} (-1)^(n+1)/a(n) = log(2)/2 - Pi/(4*sqrt(3)). (End)

Extensions

More terms from Patrick De Geest

A016970 a(n) = (6*n + 5)^2.

Original entry on oeis.org

25, 121, 289, 529, 841, 1225, 1681, 2209, 2809, 3481, 4225, 5041, 5929, 6889, 7921, 9025, 10201, 11449, 12769, 14161, 15625, 17161, 18769, 20449, 22201, 24025, 25921, 27889, 29929, 32041, 34225, 36481, 38809, 41209, 43681, 46225, 48841, 51529
Offset: 0

Views

Author

Keywords

Comments

The product of 4 successive terms of an arithmetic progression + square of the common difference is a square: a(n) = the square arising as the sum of first four terms of an arithmetic progression + n^2 where 1 is the first term and n is the common difference. a(1) = 25 = 1*2*3*4+1 a(2) = 121 = 1*3*5*7 +2^2 a(3) = 289 = 1*4*7*10 + 3^2, etc. - Amarnath Murthy, Mar 25 2004
If Y is a fixed 2-subset of a (6n+1)-set X then a(n-1) is the number of 3-subsets of X intersecting Y. - Milan Janjic, Oct 21 2007
Sequence found by reading the line from 25 in the direction 25, 121,... in the square spiral whose vertices are the generalized 20-gonal numbers. - Omar E. Pol, Jul 28 2016

Crossrefs

Cf. A016969 (6*n+5), A086731, A174371.

Programs

  • GAP
    List([0..40],n->(6*n+5)^2); # Muniru A Asiru, Dec 06 2018
    
  • Magma
    [(6*n+5)^2: n in [0..50]]; // Vincenzo Librandi, May 07 2011
    
  • Maple
    [(6*n+5)^2$n=0..40]; # Muniru A Asiru, Dec 06 2018
  • Mathematica
    Array[(6 # + 5)^2 &, 38, 0] (* or *)
    CoefficientList[Series[(-25 - 46 x - x^2)/(x - 1)^3, {x, 0, 37}], x] (* Michael De Vlieger, Dec 06 2018 *)
    CoefficientList[Series[E^x (25 + 96 x + 36 x^2), {x, 0, 50}], x]*Table[n!, {n, 0, 50}] (* Stefano Spezia, Dec 07 2018 *)
  • PARI
    a(n)=(6*n+5)^2 \\ Charles R Greathouse IV, Jul 28 2016
    
  • Sage
    s=((25+46*x+x^2)/(1-x)^3).series(x, 20); s.coefficients(x, sparse=False) # G. C. Greubel, Dec 07 2018

Formula

G.f.: (25 + 46*x + x^2) / (1-x)^3. - R. J. Mathar, Mar 10 2011
a(n) = 24 * A000326(n+1) + 1. - Jean-Bernard François, Oct 12 2014
a(n) = 6*A033579(n+1) + 1. - Miquel Cerda, Jul 28 2016
E.g.f.: exp(x)*(25 + 96*x + 36*x^2). - Stefano Spezia, Dec 07 2018
a(n) = A003215(3*n+2) + A002378(3*n+2). - Klaus Purath, Jun 09 2020
Sum_{n>=0} 1/a(n) = A086731. - Amiram Eldar, Nov 17 2020

A226492 a(n) = n*(11*n-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

Views

Author

Bruno Berselli, Jun 11 2013

Keywords

Comments

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...

Crossrefs

Cf. sequences in Comments lines.
First differences are in A017425.

Programs

  • Magma
    [n*(11*n-5)/2: n in [0..50]];
    
  • Magma
    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
    
  • Mathematica
    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 *)
  • PARI
    a(n)=n*(11*n-5)/2 \\ Charles R Greathouse IV, Sep 24 2015

Formula

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)

A033580 Four times second pentagonal numbers: a(n) = 2*n*(3*n+1).

Original entry on oeis.org

0, 8, 28, 60, 104, 160, 228, 308, 400, 504, 620, 748, 888, 1040, 1204, 1380, 1568, 1768, 1980, 2204, 2440, 2688, 2948, 3220, 3504, 3800, 4108, 4428, 4760, 5104, 5460, 5828, 6208, 6600, 7004, 7420, 7848, 8288, 8740, 9204, 9680, 10168, 10668, 11180, 11704, 12240
Offset: 0

Views

Author

Keywords

Comments

Subsequence of A062717: A010052(6*a(n)+1) = 1. - Reinhard Zumkeller, Feb 21 2011
Sequence found by reading the line from 0, in the direction 0, 8,..., in the square spiral whose vertices are the generalized pentagonal numbers A001318. Opposite numbers to the members of A139267 in the same spiral - Omar E. Pol, Sep 09 2011
a(n) is the number of edges of the octagonal network O(n,n); O(m,n) is defined by Fig. 1 of the Siddiqui et al. reference. - Emeric Deutsch May 13 2018
The partial sums of this sequence give A035006. - Leo Tavares, Oct 03 2021

Crossrefs

Programs

Formula

a(n) = a(n-1) +12*n -4 (with a(0)=0). - Vincenzo Librandi, Aug 05 2010
G.f.: 4*x*(2+x)/(1-x)^3. - Colin Barker, Feb 13 2012
a(-n) = A033579(n). - Michael Somos, Jun 09 2014
E.g.f.: 2*x*(4 + 3*x)*exp(x). - G. C. Greubel, Oct 09 2019
From Amiram Eldar, Jan 14 2021: (Start)
Sum_{n>=1} 1/a(n) = 3/2 - Pi/(4*sqrt(3)) - 3*log(3)/4.
Sum_{n>=1} (-1)^(n+1)/a(n) = -3/2 + Pi/(2*sqrt(3)) + log(2). (End)
From Leo Tavares, Oct 12 2021: (Start)
a(n) = A003154(n+1) - A016813(n). See Crossed Stars illustration.
a(n) = 4*A005449(n). See Four Quarter Star Crosses illustration.
a(n) = 2*A049451(n).
a(n) = A046092(n-1) + A033996(n). See Triangulated Star Crosses illustration.
a(n) = 4*A000217(n-1) + 8*A000217(n).
a(n) = 4*A000217(n-1) + 4*A002378. See Oblong Star Crosses illustration.
a(n) = A016754(n) + 4*A000217(n). See Crossed Diamond Stars illustration.
a(n) = 2*A001105(n) + 4*A000217(n).
a(n) = A016742(n) + A046092(n).
a(n) = 4*A000290(n) + 4*A000217(n). (End)

A080859 a(n) = 6*n^2 + 4*n + 1.

Original entry on oeis.org

1, 11, 33, 67, 113, 171, 241, 323, 417, 523, 641, 771, 913, 1067, 1233, 1411, 1601, 1803, 2017, 2243, 2481, 2731, 2993, 3267, 3553, 3851, 4161, 4483, 4817, 5163, 5521, 5891, 6273, 6667, 7073, 7491, 7921, 8363, 8817, 9283, 9761, 10251, 10753, 11267
Offset: 0

Views

Author

Paul Barry, Feb 23 2003

Keywords

Comments

The old definition of this sequence was "Generalized polygonal numbers".
Column T(n,4) of A080853.
Sequence found by reading the line from 1, in the direction 1, 11, ..., in the square spiral whose vertices are the generalized pentagonal numbers A001318. - Omar E. Pol, Sep 08 2011

Crossrefs

Subsequence of A186424.
Cf. A220083 for a list of numbers of the form n*P(s,n)-(n-1)*P(s,n-1), where P(s,n) is the n-th polygonal number with s sides.

Programs

Formula

G.f.: (C(3,0) + (C(5,2) - 2)*x + C(3,2)*x^2)/(1-x)^3 = (1 + 8*x + 3*x^2)/(1-x)^3.
E.g.f.: (1 + 10*x + 6*x^2)*exp(x). - Vincenzo Librandi, Apr 29 2016
a(n) = C(4,0) + C(4,1)n + C(4,2)n^2.
a(n) = A186424(2*n).
a(n) = 12*n + a(n-1) - 2 with n > 0, a(0)=1. - Vincenzo Librandi, Aug 08 2010
a(n) = (n+1)*A000384(n+1) - n*A000384(n). - Bruno Berselli, Dec 10 2012
a(n) = (n+1)^4 mod n^3 for n >= 7. - J. M. Bergot, Aug 14 2017
a(n) = (2*n+1)^2 + 2*n^2. - Robert FERREOL, Jan 13 2024

Extensions

Definition replaced with the closed form by Bruno Berselli, Dec 10 2012

A191967 n * (numbers that are not divisible by 3).

Original entry on oeis.org

0, 1, 4, 12, 20, 35, 48, 70, 88, 117, 140, 176, 204, 247, 280, 330, 368, 425, 468, 532, 580, 651, 704, 782, 840, 925, 988, 1080, 1148, 1247, 1320, 1426, 1504, 1617, 1700, 1820, 1908, 2035, 2128, 2262, 2360, 2501, 2604, 2752, 2860, 3015, 3128, 3290, 3408
Offset: 0

Views

Author

Reinhard Zumkeller, Jul 07 2012

Keywords

Comments

A033579 and A033570 interleaved.

Crossrefs

Programs

Formula

a(n) = n * A001651(n).
a(n) = A000326(n) - A142150(n).
a(2*n) = A033579(n) = 4 * A000326(n);
a(2*n+1) = A033570(n) = A000326(2*n+1).
G.f.: x*(1+3*x+6*x^2+2*x^3)/((1+x)^2*(1-x)^3). - Bruno Berselli, Jul 09 2012
a(n) = A182079(3n). - Bruno Berselli, Jul 09 2012
From Amiram Eldar, Feb 18 2022: (Start)
Sum_{n>=1} 1/a(n) = Pi/(4*sqrt(3)) + 9*log(3)/4 - 2*log(2).
Sum_{n>=1} (-1)^(n+1)/a(n) = sqrt(3)*Pi/4 + 3*log(3)/4 - 2*log(2). (End)
Showing 1-10 of 23 results. Next