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.

A174086 Number of permutations of length n with no consecutive triples i,...i+r,...i+2r (mod n) for all r, and for all equal spacings d.

Original entry on oeis.org

16, 40, 204, 840, 6272, 35856, 378000, 2638460, 28387728, 249444936, 3275745564, 30770034480
Offset: 4

Views

Author

Isaac Lambert, Apr 20 2010

Keywords

Comments

Here we count both the sequence 1,2,3 (r=1) as a progression in 1,2,3,0,4,5, (note d=1) and in 1,0,2,4,3,5 (here, d=2).

Examples

			For n=4 note a(4) is the same as the value in A165963 since there are no other distances that can be used (i.e. only d=1).
		

Crossrefs

Extensions

a(10)-a(15) from Bert Dobbelaere, May 18 2025