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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A349288 Number of permutations p of {1,2,...,n} such that p(k) divides p(k+1) + p(k+2) for all k in {1,2,...,n-2}. 2

%I

%S 1,2,6,6,15,14,9,28,16,37,51,13,34,44,5,20,24,15,45,52,2,8,34,21,15,

%T 13,1,2,1,0,0,0,0,1,0,0,3,7,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,

%U 0

%N Number of permutations p of {1,2,...,n} such that p(k) divides p(k+1) + p(k+2) for all k in {1,2,...,n-2}.

%H Max Alekseyev, <a href="/A349288/a349288.txt">List of suitable permutations for each n=1..60</a>

%H Falcao, <a href="https://falcao.livejournal.com/328831.html">Problem of the day-13</a>, 2021. (in Russian)

%Y Cf. A349294 (indices of nonzero terms).

%K nonn

%O 1,2

%A _Max Alekseyev_, Nov 13 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 24 18:53 EDT 2022. Contains 354043 sequences. (Running on oeis4.)