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.

A353108 a(n) is the number of cycles of n numbers arranged so that every integer in 1..n*(n-1)+1 occurs as the sum of up to n adjacent numbers. Both a solution and its reverse are counted unless they are identical.

Table of values

n a(n)
1 1
2 1
3 2
4 4
5 2
6 10
7 0
8 12
9 8
10 12
11 0
12 36
13 0
14 40
15 0
16 0
17 12
18 102
19 0
20 84
21 0
22 0
23 0

List of values

[1, 1, 2, 4, 2, 10, 0, 12, 8, 12, 0, 36, 0, 40, 0, 0, 12, 102, 0, 84, 0, 0, 0]

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

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