The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A165960 Number of permutations of length n without modular 3-sequences. 5

%I #12 Apr 14 2021 07:32:37

%S 1,1,2,3,20,100,612,4389,35688,325395,3288490,36489992,441093864,

%T 5770007009,81213878830,1223895060315,19662509071056,335472890422812,

%U 6057979285535388,115434096553014565,2314691409652237700,48723117262650147387,1074208020519710570054

%N Number of permutations of length n without modular 3-sequences.

%C Modular 3-sequences are of the following form: i,i+1,i+2, where arithmetic is modulo n.

%H Alois P. Heinz, <a href="/A165960/b165960.txt">Table of n, a(n) for n = 0..450</a>

%F a(n) = n * A165961(n).

%e For n=3 the a(3) = 3 solutions are (0,2,1), (1,0,2) and (2,1,0).

%Y Cf. A002628, A165961, A165962.

%K nonn

%O 0,3

%A _Isaac Lambert_, Oct 01 2009

%E a(0)-a(2) and a(15)-a(22) from _Alois P. Heinz_, Apr 14 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 23 11:05 EST 2024. Contains 370283 sequences. (Running on oeis4.)