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-4 of 4 results.

A268606 Number of ways to trisect a hexagon with side length n exactly into three identical parts in a triangular lattice.

Original entry on oeis.org

1, 5, 116, 15785, 11599297, 47212453928, 1100377983366327, 148568527921382084692
Offset: 1

Views

Author

Luca Petrone, Feb 08 2016

Keywords

Crossrefs

Extensions

Added a(6) from Jelliss's website by Vaclav Kotesovec, Mar 03 2016
a(7)-a(8) from Andrew Howroyd, Apr 11 2016

A271857 Number of ways to dissect a hexagon with side length n exactly into six identical parts in a triangular lattice.

Original entry on oeis.org

1, 2, 12, 173, 5429, 392544, 66961869, 27094069322, 26124568587557, 60352331499840380, 335377713005955826349, 4494480789037552980419332, 145516206571394421594063628243, 11398373584242623552596178870957640, 2162546126021822830176241418936795142991
Offset: 1

Views

Author

Andrew Howroyd, Apr 15 2016

Keywords

Comments

This sequence only enumerates those dissections in which the six pieces are arranged around the center at 60-degree intervals. Other dissections are possible, such as those formed from those trisections which can be further bisected into identical parts.

Crossrefs

A271723 Numbers k such that 3*k - 8 is a square.

Original entry on oeis.org

3, 4, 8, 11, 19, 24, 36, 43, 59, 68, 88, 99, 123, 136, 164, 179, 211, 228, 264, 283, 323, 344, 388, 411, 459, 484, 536, 563, 619, 648, 708, 739, 803, 836, 904, 939, 1011, 1048, 1124, 1163, 1243, 1284, 1368, 1411, 1499, 1544, 1636, 1683, 1779, 1828, 1928, 1979, 2083, 2136, 2244, 2299
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Apr 13 2016

Keywords

Comments

Square roots of resulting squares gives A001651. - Ray Chandler, Apr 14 2016

Examples

			a(1) = 3 because 3*3 - 8 = 1^2.
		

Crossrefs

Cf. A001651.
Cf. numbers n such that 3*n + k is a square: this sequence (k=-8), A120328 (k=-6), A271713 (k=-5), A056107 (k=-3), A257083 (k=-2), A033428 (k=0), A001082 (k=1), A080663 (k=3), A271675 (k=4), A100536 (k=6), A271741 (k=7), A067725 (k=9).

Programs

  • Magma
    [n: n in [1..2400] | IsSquare(3*n-8)];
    
  • Maple
    seq(seq(((3*m+k)^2+8)/3, k=1..2),m=0..50); # Robert Israel, Dec 05 2016
  • Mathematica
    Select[Range@ 2400, IntegerQ@ Sqrt[3 # - 8] &] (* Bruno Berselli, Apr 14 2016 *)
    LinearRecurrence[{1,2,-2,-1,1},{3,4,8,11,19},60] (* Harvey P. Dale, Oct 02 2020 *)
  • Python
    from gmpy2 import is_square
    [n for n in range(3000) if is_square(3*n-8)] # Bruno Berselli, Dec 05 2016
    
  • Python
    [(6*(n-1)*n-(2*n-1)*(-1)**n+23)/8 for n in range(1, 60)] # Bruno Berselli, Dec 05 2016

Formula

From Ilya Gutkovskiy, Apr 13 2016: (Start)
G.f.: x*(3 + x - 2*x^2 + x^3 + 3*x^4)/((1 - x)^3*(1 + x)^2).
a(n) = (6*(n - 1)*n - (2*n - 1)*(-1)^n + 23)/8. (End)

A003155 Number of ways to halve an n X n chessboard.

Original entry on oeis.org

1, 1, 1, 6, 15, 255, 1897, 92263, 1972653, 281035054, 17635484470, 7490694495750, 1405083604458437, 1789509008288411290
Offset: 1

Views

Author

Keywords

Comments

This is the number of ways to cut an n X n chessboard along grid lines into two identical pieces. In the case that n is odd the central square is first removed to ensure an even number of squares. Solutions that differ only by rotation or reflection are considered equivalent. - Andrew Howroyd, Apr 19 2016

References

  • M. Gardner, The Unexpected Hanging and Other Mathematical Diversions. Simon and Schuster, NY, 1969, p. 189.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Formula

a(2n) = A113900(n). - Andrew Howroyd, Apr 19 2016

Extensions

a(10) corrected and a(11)-a(14) from Andrew Howroyd, Apr 19 2016
Showing 1-4 of 4 results.