A324622 - OEIS

This site is supported by donations to The OEIS Foundation.

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.

Other ways to donate

A324622

Number of permutations p of [2+n] such that n is the maximum of the number of elements in any integer interval [p(i)..i+(2+n)*[i<p(i)]].

0, 1, 1, 11, 60, 435, 3473, 31315, 313227, 3445641, 41341502, 537313583, 7520316423, 112771887719, 1803821926465, 30656189582521, 551659191788556, 10478765887885181, 209522984620760153, 4398943767896801309, 96755196700729056267, 2224901906327124750355 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,4`
	LINKS	`Alois P. Heinz, Table of n, a(n) for n = 0..448`
	FORMULA	`a(n) = A000179(n+2) - A000183(n+2).`
	CROSSREFS	`Row n=2 of A324563 and column of A324564 (as array).` `Cf. A000179, A000183.` `Sequence in context: A066999 A224291 A055826 * A156704 A248874 A073625` `Adjacent sequences: A324619 A324620 A324621 * A324623 A324624 A324625`
	KEYWORD	`nonn`
	AUTHOR	`Alois P. Heinz, Mar 09 2019`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 11 12:33 EST 2019. Contains 329916 sequences. (Running on oeis4.)