Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001267
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001267 One-half the number of permutations of length n with exactly 3 rising or falling successions.
(Formerly M4550 N1934)
+0
8
0, 0, 0, 0, 1, 8, 60, 444, 3599, 32484, 325322, 3582600, 43029621, 559774736, 7841128936, 117668021988, 1883347579515, 32026067455084, 576605574327174, 10957672400252944, 219190037987444577, 4603645435776504120, 101292568208941883236, 2329975164242735146316 (list; graph; listen)
OFFSET

0,6

COMMENT

(1/2) times number of permutations of 12...n such that exactly 3 of the following occur: 12, 23, ..., (n-1)n, 21, 32, ..., n(n-1).

REFERENCES

F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 263.

J. Riordan, A recurrence for permutations without rising or falling successions. Ann. Math. Statist. 36 (1965), 708-710.

FORMULA

Coefficient of t^3 in S[n](t) defined in A002464, divided by 2.

CROSSREFS

Cf. A002464, A000130, A086852. Equals A086854/2. A diagonal of A010028.

Adjacent sequences: A001264 A001265 A001266 this_sequence A001268 A001269 A001270

Sequence in context: A093132 A094169 A129325 this_sequence A099156 A129331 A005990

KEYWORD

nonn

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research