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.

Showing 1-2 of 2 results.

A179040 Number of permutations of 1..n with no three elements collinear.

Original entry on oeis.org

1, 1, 2, 4, 18, 56, 272, 1000, 6080, 33644, 214024, 1363836, 10877964, 75783376, 648644300, 5765475224, 49406530846, 431491536076
Offset: 0

Views

Author

R. H. Hardin, including comments and references from R. J. Mathar, Max Alekseyev and Franklin T. Adams-Watters in the Sequence Fans Mailing List, Jun 25 2010

Keywords

Comments

Number of permutations of 1..n with no three points (i,p(i)) (j,p(j)) (k,p(k)) collinear, or number of n X n permutation matrices with no three 1's collinear.

Crossrefs

For "collinear modulo n" see A135538 and A146558.

Extensions

a(0)=1 prepended by Alois P. Heinz, Sep 14 2022

A146558 Number of order n permutations without collinear triples modulo n.

Original entry on oeis.org

1, 2, 0, 16, 0, 72, 0, 256, 0, 0, 0, 2304, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Max Alekseyev, Nov 01 2008

Keywords

Examples

			For n=4, there are a(4)=16 permutations without collinear triples: [1, 2, 4, 3], [1, 3, 2, 4], [1, 3, 4, 2], [1, 4, 2, 3], [2, 1, 3, 4], [2, 3, 1, 4], [2, 4, 1, 3], [2, 4, 3, 1], [3, 1, 2, 4], [3, 1, 4, 2], [3, 2, 4, 1], [3, 4, 2, 1], [4, 1, 3, 2], [4, 2, 1, 3], [4, 2, 3, 1], [4, 3, 1, 2]
		

Crossrefs

Programs

  • PARI
    { a(n) = local(p,r,g); r=0; for(j=1,n!, p=numtoperm(n,j); g=1; forvec(v=vector(3,i,[1,n]), if(matdet([1,v[1],p[v[1]];1,v[2],p[v[2]];1,v[3],p[v[3]]])%n==0, g=0; break), 2); if(g,r++)); r }

Formula

For prime p>=3, a(p) = 0.

Extensions

Edited by Max Alekseyev, Jun 21 2010
a(14)-a(29) from Bert Dobbelaere, Mar 15 2020
Showing 1-2 of 2 results.