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
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, 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, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..60.

Max Alekseyev, List of suitable permutations for each n=1..60

Falcao, Problem of the day-13, 2021. (in Russian)

CROSSREFS

Cf. A349294 (indices of nonzero terms).

Sequence in context: A251548 A316785 A056136 * A098571 A194120 A161503

Adjacent sequences:  A349285 A349286 A349287 * A349289 A349290 A349291

KEYWORD

nonn

AUTHOR

Max Alekseyev, Nov 13 2021

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 09:05 EST 2022. Contains 350475 sequences. (Running on oeis4.)