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 12 results. Next

A003215 Hex (or centered hexagonal) numbers: 3*n*(n+1)+1 (crystal ball sequence for hexagonal lattice).

Original entry on oeis.org

1, 7, 19, 37, 61, 91, 127, 169, 217, 271, 331, 397, 469, 547, 631, 721, 817, 919, 1027, 1141, 1261, 1387, 1519, 1657, 1801, 1951, 2107, 2269, 2437, 2611, 2791, 2977, 3169, 3367, 3571, 3781, 3997, 4219, 4447, 4681, 4921, 5167, 5419, 5677, 5941, 6211, 6487, 6769
Offset: 0

Views

Author

N. J. A. Sloane

Keywords

Comments

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.
Crystal ball sequence for A_2 lattice. - Michael Somos, Jun 03 2012
Sixth spoke of hexagonal spiral (cf. A056105-A056109).
Number of ordered integer triples (a,b,c), -n <= a,b,c <= n, such that a+b+c=0. - Benoit Cloitre, Jun 14 2003
Also the number of partitions of 6n into at most 3 parts, A001399(6n). - R. K. Guy, Oct 20 2003
Also, a(n) is the number of partitions of 6(n+1) into exactly 3 distinct parts. - William J. Keith, Jul 01 2004
Number of dots in a centered hexagonal figure with n+1 dots on each side.
Values of second Bessel polynomial y_2(n) (see A001498).
First differences of cubes (A000578). - Cecilia Rossiter (cecilia(AT)noticingnumbers.net), Dec 15 2004
Final digits of Hex numbers (hex(n) mod 10) are periodic with palindromic period of length 5 {1, 7, 9, 7, 1}. Last two digits of Hex numbers (hex(n) mod 100) are periodic with palindromic period of length 100. - Alexander Adamchuk, Aug 11 2006
All divisors of a(n) are congruent to 1, modulo 6. Proof: If p is an odd prime different from 3 then 3n^2 + 3n + 1 = 0 (mod p) implies 9(2n + 1)^2 = -3 (mod p), whence p = 1 (mod 6). - Nick Hobson, Nov 13 2006
For n>=1, a(n) is the side of Outer Napoleon Triangle whose reference triangle is a right triangle with legs (3a(n))^(1/2) and 3n(a(n))^(1/2). - Tom Schicker (tschicke(AT)email.smith.edu), Apr 25 2007
Number of triples (a,b,c) where 0<=(a,b)<=n and c=n (at least once the term n). E.g., for n = 1: (0,0,1), (0,1,0), (1,0,0), (0,1,1), (1,0,1), (1,1,0), (1,1,1), so a(1)=7. - Philippe Lallouet (philip.lallouet(AT)wanadoo.fr), Aug 20 2007
Equals the triangular numbers convolved with [1, 4, 1, 0, 0, 0, ...]. - Gary W. Adamson and Alexander R. Povolotsky, May 29 2009
From Terry Stickels, Dec 07 2009: (Start)
Also the maximum number of viewable cubes from any one static point while viewing a cube stack of identical cubes of varying magnitude.
For example, viewing a 2 X 2 X 2 stack will yield 7 maximum viewable cubes.
If the stack is 3 X 3 X 3, the maximum number of viewable cubes from any one static position is 19, and so on.
The number of cubes in the stack must always be the same number for width, length, height (at true regular cubic stack) and the maximum number of visible cubes can always be found by taking any cubic number and subtracting the number of the cube that is one less.
Examples: 125 - 64 = 61, 64 - 27 = 37, 27 - 8 = 19. (End)
The sequence of digital roots of the a(n) is period 3: repeat [1,7,1]. - Ant King, Jun 17 2012
The average of the first n (n>0) centered hexagonal numbers is the n-th square. - Philippe Deléham, Feb 04 2013
A002024 is the following array A read along antidiagonals:
1, 2, 3, 4, 5, 6, ...
2, 3, 4, 5, 6, 7, ...
3, 4, 5, 6, 7, 8, ...
4, 5, 6, 7, 8, 9, ...
5, 6, 7, 8, 9, 10, ...
6, 7, 8, 9, 10, 11, ...
and a(n) is the hook sum Sum_{k=0..n} A(n,k) + Sum_{r=0..n-1} A(r,n). - R. J. Mathar, Jun 30 2013
a(n) is the sum of the terms in the n+1 X n+1 matrices minus those in n X n matrices in an array formed by considering A158405 an array (the beginning terms in each row are 1,3,5,7,9,11,...). - J. M. Bergot, Jul 05 2013
The formula also equals the product of the three distinct combinations of two consecutive numbers: n^2, (n+1)^2, and n*(n+1). - J. M. Bergot, Mar 28 2014
The sides of any triangle ABC are divided into 2n + 1 equal segments by 2n points: A_1, A_2, ..., A_2n in side a, and also on the sides b and c cyclically. If A'B'C' is the triangle delimited by AA_n, BB_n and CC_n cevians, we have (ABC)/(A'B'C') = a(n) (see Java applet link). - Ignacio Larrosa Cañestro, Jan 02 2015
a(n) is the maximal number of parts into which (n+1) triangles can intersect one another. - Ivan N. Ianakiev, Feb 18 2015
((2^m-1)n)^t mod a(n) = ((2^m-1)(n+1))^t mod a(n) = ((2^m-1)(2n+1))^t mod a(n), where m any positive integer, and t = 0(mod 6). - Alzhekeyev Ascar M, Oct 07 2016
((2^m-1)n)^t mod a(n) = ((2^m-1)(n+1))^t mod a(n) = a(n) - (((2^m-1)(2n+1))^t mod a(n)), where m any positive integer, and t = 3(mod 6). - Alzhekeyev Ascar M, Oct 07 2016
(3n+1)^(a(n)-1) mod a(n) = (3n+2)^(a(n)-1) mod a(n) = 1. If a(n) not prime, then always strong pseudoprime. - Alzhekeyev Ascar M, Oct 07 2016
Every positive integer is the sum of 8 hex numbers (zero included), at most 3 of which are greater than 1. - Mauro Fiorentini, Jan 01 2018
Area enclosed by the segment of Archimedean spiral between n*Pi/2 and (n+1)*Pi/2 in Pi^3/48 units. - Carmine Suriano, Apr 10 2018
This sequence contains all numbers k such that 12*k - 3 is a square. - Klaus Purath, Oct 19 2021
The continued fraction expansion of sqrt(3*a(n)) is [3n+1; {1, 1, 2n, 1, 1, 6n+2}]. For n = 0, this collapses to [1; {1, 2}]. - Magus K. Chu, Sep 12 2022

Examples

			G.f. = 1 + 7*x + 19*x^2 + 37*x^3 + 61*x^4 + 91*x^5 + 127*x^6 + 169*x^7 + 217*x^8 + ...
From _Omar E. Pol_, Aug 21 2011: (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
.
.   1      7          19             37
.
(End)
From _Klaus Purath_, Dec 03 2021: (Start)
(1) a(19) is not a prime number, because besides a(19) = a(9) + P(29), a(19) = a(15) + P(20) = a(2) + P(33) is also true.
(2) a(25) is prime, because except for a(25) = a(12) + P(38) there is no other equation of this pattern. (End)

References

  • John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 81.
  • M. Gardner, Time Travel and Other Mathematical Bewilderments. Freeman, NY, 1988, p. 18.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Crossrefs

Cf. A000124, A000166, A000217, A000290, A000578 (the cubes, or partial sums), A001263, A001498, A002061, A002378, A002407 (primes), A003514, A005408, A005449, A005891, A028896, A048766, A056105, A056106, A056107, A056108, A056109, A063496, A056220, A130298, A132111 (second diagonal), A158405, A215630, A239449, A243201.
Column k=3 of A080853, and column k=2 of A047969.
See also 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. A287326(A000124(n), 1).
Cf. A008292.
Cf. A005448, A140091, A001844, A000384, A060544, A045943.
Cf. A154105.

Programs

Formula

a(n) = 3*n*(n+1) + 1, n >= 0 (see the name).
a(n) = (n+1)^3 - n^3 = a(-1-n).
G.f.: (1 + 4*x + x^2) / (1 - x)^3. - Simon Plouffe in his 1992 dissertation
a(n) = 6*A000217(n) + 1.
a(n) = a(n-1) + 6*n = 2a(n-1) - a(n-2) + 6 = 3*a(n-1) - 3*a(n-2) + a(n-3) = A056105(n) + 5n = A056106(n) + 4*n = A056107(n) + 3*n = A056108(n) + 2*n = A056108(n) + n.
n-th partial arithmetic mean is n^2. - Amarnath Murthy, May 27 2003
a(n) = 1 + Sum_{j=0..n} (6*j). E.g., a(2)=19 because 1+ 6*0 + 6*1 + 6*2 = 19. - Xavier Acloque, Oct 06 2003
The sum of the first n hexagonal numbers is n^3. That is, Sum_{n>=1} (3*n*(n-1) + 1) = n^3. - Edward Weed (eweed(AT)gdrs.com), Oct 23 2003
a(n) = right term in M^n * [1 1 1], where M = the 3 X 3 matrix [1 0 0 / 2 1 0 / 3 3 1]. M^n * [1 1 1] = [1 2n+1 a(n)]. E.g., a(4) = 61, right term in M^4 * [1 1 1], since M^4 * [1 1 1] = [1 9 61] = [1 2n+1 a(4)]. - Gary W. Adamson, Dec 22 2004
Row sums of triangle A130298. - Gary W. Adamson, Jun 07 2007
a(n) = 3*n^2 + 3*n + 1. Proof: 1) If n occurs once, it may be in 3 positions; for the two other ones, n terms are independently possible, then we have 3*n^2 different triples. 2) If the term n occurs twice, the third one may be placed in 3 positions and have n possible values, then we have 3*n more different triples. 3) The term n may occurs 3 times in one way only that gives the formula. - Philippe Lallouet (philip.lallouet(AT)wanadoo.fr), Aug 20 2007
Binomial transform of [1, 6, 6, 0, 0, 0, ...]; Narayana transform (A001263) of [1, 6, 0, 0, 0, ...]. - Gary W. Adamson, Dec 29 2007
a(n) = (n-1)*A000166(n) + (n-2)*A000166(n-1) = (n-1)floor(n!*e^(-1)+1) + (n-2)*floor((n-1)!*e^(-1)+1) (with offset 0). - Gary Detlefs, Dec 06 2009
a(n) = A028896(n) + 1. - Omar E. Pol, Oct 03 2011
a(n) = integral( (sin((n+1/2)x)/sin(x/2))^3, x=0..Pi)/Pi. - Yalcin Aktar, Dec 03 2011
Sum_{n>=0} 1/a(n) = Pi/sqrt(3)*tanh(Pi/(2*sqrt(3))) = 1.305284153013581... - Ant King, Jun 17 2012
a(n) = A000290(n) + A000217(2n+1). - Ivan N. Ianakiev, Sep 24 2013
a(n) = A002378(n+1) + A056220(n) = A005408(n) + 2*A005449(n) = 6*A000217(n) + 1. - Ivan N. Ianakiev, Sep 26 2013
a(n) = 6*A000124(n) - 5. - Ivan N. Ianakiev, Oct 13 2013
a(n) = A239426(n+1) / A239449(n+1) = A215630(2*n+1,n+1). - Reinhard Zumkeller, Mar 19 2014
a(n) = A243201(n) / A002061(n + 1). - Mathew Englander, Jun 03 2014
a(n) = A101321(6,n). - R. J. Mathar, Jul 28 2016
E.g.f.: (1 + 6*x + 3*x^2)*exp(x). - Ilya Gutkovskiy, Jul 28 2016
a(n) = (A001844(n) + A016754(n))/2. - Bruce J. Nicholson, Aug 06 2017
a(n) = A045943(2n+1). - Miquel Cerda, Jan 22 2018
a(n) = 3*Integral_{x=n..n+1} x^2 dx. - Carmine Suriano, Apr 10 2018
a(n) = A287326(A000124(n), 1). - Kolosov Petro, Oct 22 2018
From Amiram Eldar, Jun 20 2020: (Start)
Sum_{n>=0} a(n)/n! = 10*e.
Sum_{n>=0} (-1)^(n+1)*a(n)/n! = 2/e. (End)
G.f.: polylog(-3, x)*(1-x)/x. See the Simon Plouffe formula above, and the g.f. of the rows of A008292 by Vladeta Jovovic, Sep 02 2002. - Wolfdieter Lang, May 08 2021
a(n) = T(n-1)^2 - 2*T(n)^2 + T(n+1)^2, n >= 1, T = triangular number A000217. - Klaus Purath, Oct 11 2021
a(n) = 1 + 2*Sum_{j=n..2n} j. - Klaus Purath, Oct 19 2021
a(n) = A069099(n+1) - A000217(n). - Klaus Purath, Nov 03 2021
From Leo Tavares, Dec 03 2021: (Start)
a(n) = A005448(n) + A140091(n);
a(n) = A001844(n) + A002378(n);
a(n) = A005891(n) + A000217(n);
a(n) = A000290(n) + A000384(n+1);
a(n) = A060544(n-1) + 3*A000217(n);
a(n) = A060544(n-1) + A045943(n).
a(2*n+1) = A154105(n).
(End)

Extensions

Partially edited by Joerg Arndt, Mar 11 2010

A193986 T(n,k) is the number of ways to arrange k nonattacking triangular rooks on an nXnXn triangular grid.

Original entry on oeis.org

1, 0, 3, 0, 0, 6, 0, 0, 3, 10, 0, 0, 0, 15, 15, 0, 0, 0, 2, 45, 21, 0, 0, 0, 0, 23, 105, 28, 0, 0, 0, 0, 0, 127, 210, 36, 0, 0, 0, 0, 0, 18, 468, 378, 45, 0, 0, 0, 0, 0, 0, 233, 1352, 630, 55, 0, 0, 0, 0, 0, 0, 6, 1449, 3310, 990, 66, 0, 0, 0, 0, 0, 0, 0, 270, 6213, 7190, 1485, 78, 0, 0, 0, 0
Offset: 1

Views

Author

R. H. Hardin, Aug 10 2011

Keywords

Comments

Empirical: minimum-n nonzero T(n,k) is at n=k+floor(k/2) and this T(k+floor(k/2),k) is A002047((k-1)/2) for k odd
Table starts
...1....0......0.......0........0........0.........0.........0........0.......0
...3....0......0.......0........0........0.........0.........0........0.......0
...6....3......0.......0........0........0.........0.........0........0.......0
..10...15......2.......0........0........0.........0.........0........0.......0
..15...45.....23.......0........0........0.........0.........0........0.......0
..21..105....127......18........0........0.........0.........0........0.......0
..28..210....468.....233........6........0.........0.........0........0.......0
..36..378...1352....1449......270........0.........0.........0........0.......0
..45..630...3310....6213.....3195......166.........0.........0........0.......0
..55..990...7190...20993....21273.....4902........28.........0........0.......0
..66.1485..14260...59943...101484....54771......4842.........0........0.......0
..78.2145..26330..150903...386052...382439....104448......2532........0.......0
..91.3003..45885..344323..1243899..1976455...1127473....140598......244.......0
.105.4095..76237..726033..3527469..8250687...8147469...2568288...120052.......0
.120.5460.121688.1434678..9035376.29309540..44813100..27060693..4373740...49620
.136.7140.187712.2685046.21297492.91705972.201616740.200826477.71690568.5227020

Examples

			Some solutions for n=5 k=3
......0..........0..........0..........0..........1..........0..........0
.....0.0........0.0........0.0........0.1........0.0........0.0........0.1
....0.1.0......0.0.1......1.0.0......0.0.0......0.0.0......1.0.0......1.0.0
...0.0.0.1....1.0.0.0....0.0.1.0....0.0.1.0....0.1.0.0....0.0.1.0....0.0.1.0
..0.0.1.0.0..0.0.0.1.0..0.1.0.0.0..1.0.0.0.0..0.0.0.1.0..0.0.0.0.1..0.0.0.0.0

Links

Crossrefs

Row sums plus 1 give A289709.
Column 1 is A000217.
Column 2 is A050534.

A309260 Number of ways of placing 2n-1 nonattacking rooks on a hexagonal board with edge-length n in Glinski's hexagonal chess, inequivalent up to rotations and reflections of the board.

Original entry on oeis.org

1, 1, 1, 5, 29, 224, 3012, 55200, 1259794, 35488536, 1200819600
Offset: 1

Views

Author

Sangeet Paul, Jul 19 2019

Keywords

Comments

A rook in Glinski's hexagonal chess can move to any cell along the perpendicular bisector of any of the 6 edges of the hexagonal cell it's on (analogous to a rook in orthodox chess which can move to any cell along the perpendicular bisector of any of the 4 edges of the square cell it's on).

Examples

			a(1) = 1
.
  o
.
a(2) = 1
.
   o .
  . . o
   o .
.
a(3) = 1
.
    o . .
   . . o .
  . . . . o
   o . . .
    . o .
.
a(4) = 5
.
     o . . .        o . . .        o . . .        . o . .        . o . .
    . . o . .      . . o . .      . . . o .      o . . . .      . . . . o
   . . . . o .    . . . . . o    . . . . . o    . . . . . o    o . . . . .
  . . . . . . o  . o . . . . .  . . o . . . .  . . . o . . .  . . . o . . .
   o . . . . .    . . . . . o    o . . . . .    . . . . . o    . . . . . o
    . o . . .      . . o . .      . . . . o      o . . . .      o . . . .
     . . o .        o . . .        . o . .        . o . .        . . o .
.

Links

Crossrefs

Cf. A000903, A002047, A003215, A309746, A309669.

Extensions

a(1)-a(7) confirmed by Vaclav Kotesovec, Aug 16 2019
a(8) from Alain Brobecker, Dec 10 2021
a(8) confirmed by Vaclav Kotesovec, Dec 12 2021
a(9) from Alain Brobecker, Dec 13 2021
a(9) confirmed by Vaclav Kotesovec, Dec 18 2021
a(10)-a(11) from Bert Dobbelaere, Oct 24 2022

A289893 Number of maximum independent vertex sets in the n-triangular honeycomb queen graph.

Original entry on oeis.org

1, 3, 3, 2, 23, 18, 6, 270, 166, 28, 4842, 2532, 244, 120052, 49620, 2544, 3852972, 1270832, 35600, 156145080, 40668960, 659632, 7746956424, 1606984224, 15106128, 460265296128, 75930070688, 425802176
Offset: 1

Views

Author

Eric W. Weisstein, Jul 14 2017

Keywords

Links

Crossrefs

Cf. A002047, A350041, A350191, A004396 (independence number).

Formula

a(3*n+1) agrees with A002047(n) for available terms.

Extensions

a(18)-a(19) from Vaclav Kotesovec, Dec 13 2021
a(20) from Vaclav Kotesovec, Dec 16 2021
a(21)-a(28) from Martin Ehrenstein, Dec 17 2021

A309746 Number of ways of placing 2*n-1 nonattacking queens on a hexagonal board with edge-length n in Glinski's hexagonal chess.

Original entry on oeis.org

1, 0, 0, 2, 0, 0, 0, 6, 0, 36, 0, 72, 332, 1596, 6972
Offset: 1

Views

Author

Vaclav Kotesovec, Aug 15 2019

Keywords

Comments

Conjecture: for n >= 12 is a(n) > 0. Proved for n <= 20. - Vaclav Kotesovec, Sep 06 2019

Links

Crossrefs

Cf. A002047, A003215, A309260, A309669.

Extensions

a(15) from Vaclav Kotesovec, Aug 28 2019

A260333 Irregular triangle read by rows: T(n,k) = number of ways k brooks (0 <= k <= 2n+1) can be placed on the grid points of an n triboard so that no two brooks lie in the same straight line.

Original entry on oeis.org

1, 1, 1, 7, 6, 2, 1, 19, 87, 115, 30, 6, 1, 37, 417, 1783, 2902, 1629, 196, 28, 1, 61, 1278, 11758, 50465, 99717, 84366, 26836, 2196, 244, 1, 91, 3060, 49304, 413473, 1841079, 4277156, 4929400, 2572104, 523432, 27984, 2544, 1, 127, 6261, 156633, 2184561
Offset: 0

Views

Author

N. J. A. Sloane, Jul 27 2015

Keywords

Comments

An "n triboard" is a hexagonal board or grid with n segments (and n+1 points) per side. - N. J. A. Sloane, Aug 20 2015

Examples

			Triangle begins:
1,1,
1,7,6,2,
1,19,87,115,30,6,
1,37,417,1783,2902,1629,196,28,
1,61,1278,11758,50465,99717,84366,26836,2196,244,
1,91,3060,49304,413473,1841079,4277156,4929400,2572104,523432,27984,2544
...

Links

Crossrefs

A002047 is the right diagonal.
The two nontrivial left diagonals are A003215 and A047786. The third is conjectured to be A260334.

Formula

Bennett and Potts give formulas for the first two nontrivial diagonals on the left (A003215 and A047786), and conjectural formulas for the next two diagonals.

Extensions

More terms from Lars Blomberg, Aug 20 2015

A289971 Number of permutations of [n] determined by their antidiagonal sums.

Original entry on oeis.org

1, 1, 2, 4, 9, 20, 49, 114, 277, 665, 1608, 3875
Offset: 0

Views

Author

Martin Rubey, Jul 16 2017

Keywords

Links

Crossrefs

Cf. A019589, A002047, A290279, A290280.

Programs

  • Mathematica
    xray[perm_List] := Module[{P, n = Length[perm]}, P[, ] = 0; Thread[perm -> Range[n]] /. Rule[i_, j_] :> Set[P[i, j], 1]; Table[Sum[P[i - j + 1, j], {j, Max[1, i - n + 1], Min[i, n]}], {i, 1, 2n - 1}]];
a[n_] := xray /@ Permutations[Range[n]] // Tally // Count[#, {_List, 1}]&;
Do[Print[n, " ", a[n]], {n, 0, 10}] (* Jean-François Alcover, Feb 28 2020 *)
  • Sage
    def X_ray(pi):
    P = Permutation(pi).to_matrix()
    n = P.nrows()
    return tuple(sum(P[k-1-j][j] for j in range(max(0, k-n), min(k,n)))
                 for k in range(1,2*n))
@cached_function
def X_rays(n):
    return sorted(X_ray(pi) for pi in Permutations(n))
def statistic(pi): return X_rays(pi.size()).count(X_ray(pi))
[[statistic(pi) for pi in Permutations(n)].count(1) for n in range(7)]

Extensions

a(8)-a(11) from Alois P. Heinz, Jul 24 2017

A350191 Number of ways of placing maximum number of nonattacking rooks on a triangular board with edge-length n (not counting rotations and reflections as distinct).

Original entry on oeis.org

1, 1, 1, 1, 5, 3, 1, 45, 29, 5, 807, 422, 29, 20022, 8270, 224, 642162, 211848, 3012
Offset: 1

Views

Author

Vaclav Kotesovec, Dec 19 2021

Keywords

Comments

a(n) = A350041(n) for n <> 10,13,16,19,...
Conjecture: a(3*n-2) = A309260(n). There is a nice analogy with A289893(3*n+1) = A002047(n).

Links

Crossrefs

Cf. A350041, A289893.

A047786 a(n) = (9*n^4 + 4*n^3 - n)/2.

Original entry on oeis.org

0, 6, 87, 417, 1278, 3060, 6261, 11487, 19452, 30978, 46995, 68541, 96762, 132912, 178353, 234555, 303096, 385662, 484047, 600153, 735990, 893676, 1075437, 1283607, 1520628, 1789050, 2091531, 2430837, 2809842, 3231528, 3698985, 4215411, 4784112, 5408502
Offset: 0

Views

Author

N. J. A. Sloane

Keywords

Comments

In a triangular lattice, draw a regular hexagon of side length n (that is, n+1 points on a side). Then a(n) is the number of ways to choose two lattice points that do not lie on a line parallel to any side of the hexagon. (See the Bennett and Potts paper.) - Mikhail Lavrov, Jun 12 2023

Examples

			From _Mikhail Lavrov_, Jun 12 2023: (Start)
For n=1 the a(1)=6 ways to choose two points are illustrated below:
.
.    X o     o X     o o     o o     X o     o X
.   o o X   o o o   o o X   X o o   o o o   X o o
.    o o     o X     X o     o X     X o     o o
.
(End)

Links

Crossrefs

The number of points in the hexagon is A003215. The number of ways to choose 2n+1 points, no two of which are on a line, is A002047.

Programs

  • GAP
    List([0..30], n-> n*(9*n^3 +4*n^2 -1)/2) # G. C. Greubel, May 17 2019
  • Magma
    [(9*n^4+4*n^3-n)/2: n in [0..40]]; // Vincenzo Librandi, May 29 2016
  • Mathematica
    Table[(9n^4+4n^3-n)/2,{n,0,30}] (* or *) LinearRecurrence[{5,-10,10,-5,1},{0,6,87,417,1278},30] (* Harvey P. Dale, May 26 2016 *)
  • PARI
    {a(n) = n*(9*n^3 +4*n^2 -1)/2}; \\ G. C. Greubel, May 17 2019
  • Sage
    [n*(9*n^3 +4*n^2 -1)/2 for n in (0..30)] # G. C. Greubel, May 17 2019

Formula

O.g.f.: 3*x*(2 + 19*x + 14*x^2 + x^3)/(1-x)^5. - R. J. Mathar, Feb 26 2008
E.g.f.: x*(12 + 75*x + 58*x^2 + 9*x^3)*exp(x)/2. - Robert Israel, May 29 2016

A260334 a(n) = (36*n^6 - 60*n^5 + 30*n^4 + 4*n^3 + 8*n^2 - 4*n + 1 - (-1)^n)/8.

Original entry on oeis.org

0, 2, 115, 1783, 11758, 49304, 156633, 412589, 949564, 1973662, 3788095, 6819827, 11649450, 19044308, 29994853, 45754249, 67881208, 98286074, 139280139, 193628207, 264604390, 356051152, 472441585, 618944933, 801495348, 1026863894, 1302733783, 1637778859, 2041745314, 2525536652
Offset: 0

Views

Author

N. J. A. Sloane, Jul 27 2015

Keywords

Links

Crossrefs

Conjectured to be the 4th diagonal of A260333.

Programs

  • Mathematica
    Table[(36n^6-60n^5+30n^4+4n^3+8n^2-4n+1-(-1)^n)/8,{n,0,30}] (* or *) LinearRecurrence[{6,-14,14,0,-14,14,-6,1},{0,2,115,1783,11758,49304,156633,412589},30] (* Harvey P. Dale, Apr 14 2020 *)
  • PARI
    concat(0, Vec(-x*(17*x^6 +487*x^5 +2108*x^4 +2642*x^3 +1121*x^2 +103*x +2) / ((x -1)^7*(x +1)) + O(x^100))) \\ Colin Barker, Jul 29 2015

Formula

G.f.: -x*(17*x^6+487*x^5+2108*x^4+2642*x^3+1121*x^2+103*x+2) / ((x-1)^7*(x+1)). - Colin Barker, Jul 29 2015
Showing 1-10 of 12 results. Next

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

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