The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A110128

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A110128

Number of permutations p of 1,2,...,n satisfying |p(i+2)-p(i)| not equal to 2 for all 0<i<n-1.
(history; published version)

#43 by Alois P. Heinz at Wed Feb 08 09:07:07 EST 2023

STATUS

editing

approved

#42 by Alois P. Heinz at Wed Feb 08 09:07:04 EST 2023

CROSSREFS

Column k=2 of A333706.

STATUS

approved

editing

#41 by Vaclav Kotesovec at Wed Dec 07 12:55:55 EST 2022

STATUS

editing

approved

#40 by Vaclav Kotesovec at Wed Dec 07 12:55:48 EST 2022

CROSSREFS

Cf. A089222, A002464, A117574, A189281.

STATUS

approved

editing

#39 by OEIS Server at Wed Dec 07 11:43:29 EST 2022

LINKS

Rintaro Matsuo, <a href="/A110128/b110128_2.txt">Table of n, a(n) for n = 0..600</a> (terms up to a(35) from Vaclav Kotesovec)

#38 by N. J. A. Sloane at Wed Dec 07 11:43:29 EST 2022

STATUS

editing

approved

Discussion

Wed Dec 07

11:43

OEIS Server: Installed new b-file as b110128.txt.  Old b-file is now b110128_2.txt.

#37 by N. J. A. Sloane at Wed Dec 07 11:43:26 EST 2022

COMMENTS

Note that the conjectured recurrence was based on the 600-term b-file, not the other way round. - N. J. A. Sloane, Dec 07 2022

STATUS

reviewed

editing

#36 by Joerg Arndt at Wed Dec 07 11:23:18 EST 2022

STATUS

proposed

reviewed

Discussion

Wed Dec 07

11:31

Peter Luschny: Manuel, is the b-file based on the guessed recurrence?

11:33

Manuel Kauers: No, they were generated by Rintaro Matsuo using his rigorous polynomial time algorithm. The guessed recurrence was obtained from the terms he computed.

#35 by Joerg Arndt at Wed Dec 07 11:23:15 EST 2022

STATUS

editing

proposed

#34 by Joerg Arndt at Wed Dec 07 11:22:54 EST 2022

LINKS

Manuel Kauers, <a href="/A110128/a110128_1.txt">Guessed recurrence operator of order 24 and degree 64</a>