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.
%I A174086 #6 May 18 2025 19:01:25 %S A174086 16,40,204,840,6272,35856,378000,2638460,28387728,249444936, %T A174086 3275745564,30770034480 %N 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. %C A174086 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). %e A174086 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). %Y A174086 Cf. A165963, A174084, A174085, A174087. %K A174086 nonn %O A174086 4,1 %A A174086 _Isaac Lambert_, Apr 20 2010 %E A174086 a(10)-a(15) from _Bert Dobbelaere_, May 18 2025