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.

User: Roman Mecholsky

Roman Mecholsky's wiki page.

Roman Mecholsky has authored 3 sequences.

A361635 Number of strictly-convex unit-sided polygons with all internal angles equal to a multiple of Pi/n, ignoring rotational and reflectional copies.

Original entry on oeis.org

0, 1, 3, 4, 7, 16, 17, 28, 70, 85, 125, 392, 379, 704, 3359, 2248, 4111, 18510, 14309, 30820
Offset: 1

Author

Roman Mecholsky, Mar 18 2023

Keywords

Examples

			For n=3, a(3) is computed as follows:  The base angle is Pi/3 (60 degrees).  Thus any internal angle can only be either Pi/3 or 2*Pi/3.  Call an interior angle with Pi/3 a "1" and with 2*Pi/3 a "2".  Since all external angles will add to 2*Pi, we know that the only possible sequences (ignoring rotation and reflection) are {{1, 1, 1}, {1, 1, 2, 2}, {1, 2, 1, 2}, {1, 2, 2, 2, 2}, {2, 2, 2, 2, 2, 2}}.  However, neither {1, 1, 2, 2} nor {1, 2, 2, 2, 2} forms a closed polygon.  Thus the final set is {{1, 1, 1}, {1, 2, 1, 2}, {2, 2, 2, 2, 2, 2}}, which gives a(3) = 3.
		

Crossrefs

Formula

a(p) = (2^(p-1)-1)/p + 2^((p-1)/2) for odd prime p. - Andrew Howroyd, Mar 22 2023

Extensions

a(7) and a(9) corrected and a(11)-a(20) from Andrew Howroyd, Mar 22 2023

A361659 Number of strictly convex unit-sided polygons with all internal angles equal to a multiple of Pi/n, treating polygons that have a unique mirror image as distinct but ignoring rotational copies.

Original entry on oeis.org

0, 1, 3, 4, 7, 17, 19, 34, 92, 115, 187, 616, 631, 1201, 6067, 4114, 7711, 35322, 27595, 59704, 328833, 190933, 364723, 2435778, 1579882, 2582059, 21013768, 9894292, 18512791, 377367013, 69273667, 134219794, 1678410949, 505301839, 1339499035, 14843799550
Offset: 1

Author

Roman Mecholsky, Mar 19 2023

Keywords

Crossrefs

Cf. A164896, A262181, A361635 (up to rotations and reflections).

Formula

a(n) = A164896(2*n) - 2. - Andrew Howroyd, Mar 22 2023

Extensions

a(7) corrected and terms a(9) and beyond from Andrew Howroyd, Mar 22 2023

A344230 Squares visited by a knight (chess piece) moving to the lowest-numbered unvisited square at each step on a semi-infinite chessboard numbered by starting in the lower left and filling in squares in a counterclockwise way moving to the bottom leftmost unnumbered square when the edge of the board is encountered.

Original entry on oeis.org

1, 6, 9, 2, 7, 4, 5, 8, 11, 14, 3, 10, 19, 22, 15, 12, 17, 28, 13, 18, 29, 32, 23, 16, 35, 46, 21, 34, 25, 48, 33, 20, 27, 40, 31, 54, 39, 26, 51, 68, 41, 44, 55, 30, 43, 60, 47, 24, 49, 62, 45, 42, 53, 38, 65, 52, 37, 66, 85, 70, 57, 76, 61, 80, 97, 116, 75, 56, 59, 74, 71, 58, 73, 88, 69, 84, 101, 124, 83, 50, 67, 82, 103, 86, 107, 72, 87, 104, 123, 148, 105, 128, 89, 92, 109, 112, 93, 90, 111, 130, 91, 108, 127, 152, 131, 134, 113, 94, 77, 98, 63, 36
Offset: 1

Author

Roman Mecholsky, May 12 2021

Keywords

Comments

The sequence is finite and ends at the 111th move, which takes the knight to the square numbered 36 (the leftmost square on the 6th row).
The squares on the board are numbered as follows:
. . . . . . .
. . . . . . .
. . . . . . .
+----+----+----+----+----+----+----+
| 49 | 48 | 47 | 46 | 45 | 44 | 43 | ...
ending +----+----+----+----+----+----+----+
square ---> | 36 | 35 | 34 | 33 | 32 | 31 | 42 | ...
+----+----+----+----+----+----+----+
| 25 | 24 | 23 | 22 | 21 | 30 | 41 | ...
+----+----+----+----+----+----+----+
| 16 | 15 | 14 | 13 | 20 | 29 | 40 | ...
+----+----+----+----+----+----+----+
| 9 | 8 | 7 | 12 | 19 | 28 | 39 | ...
+----+----+----+----+----+----+----+
| 4 | 3 | 6 | 11 | 18 | 27 | 38 | ...
starting +----+----+----+----+----+----+----+
square ---> | 1 | 2 | 5 | 10 | 17 | 26 | 37 | ...
+----+----+----+----+----+----+----+

Crossrefs

Cf. A316667.

Programs

  • Mathematica
    findvalue[{i_, j_}] := If[j > i, (j - 1)^2 + 2 j - i, (i - 1)^2 + j];
    possiblemoves[{i_, j_}, prev_List] :=
      Block[{moves = {{i + 2, j + 1}, {i + 2, j - 1}, {i + 1,
           j + 2}, {i + 1, j - 2}, {i - 1, j + 2}, {i - 1, j - 2}, {i - 2,
            j + 1}, {i - 2, j - 1}}, list},
       list = DeleteCases[moves, {x_, y_} /; x < 1 || y < 1];
       Complement[list, Intersection[list, prev]]];
    findnextmove =
      Block[{listofmoves = #, nextmove, poss},
        pos = possiblemoves[listofmoves[[-1]], listofmoves];
        If[Length[pos] > 0,
         nextmove = Sort[({findvalue[#], #} &) /@ pos][[1, 2]];
         AppendTo[listofmoves, nextmove], listofmoves]] &;
    findvalue /@ FixedPoint[findnextmove, {{1, 1}}]