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.

A174082 Number of circular permutations of (0,1,...,n-1) with no consecutive triples i,i+d,i+2d for all d>0.

Original entry on oeis.org

1, 1, 1, 5, 18, 91, 544, 3842, 30573, 277532, 2770405, 30591153, 366836571, 4783219673, 66906770461, 1006000805687
Offset: 1

Views

Author

Isaac Lambert, Mar 15 2010

Keywords

Comments

Circular permutations are permutations whose indices are from the ring of integers modulo n.

Examples

			For n=4 there is only (4-1)!-a(4) = 1 circular permutation with a consecutive triple i,i+d,i+2d. It is (0,1,2,3).
		

Crossrefs

Extensions

a(1)-a(3) and a(10)-a(13) from Pontus von Brömssen, Feb 11 2024
a(14)-a(16) from Bert Dobbelaere, May 18 2025