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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A183270 T(n,k)=Number of singly defective permutations of 1..n+2*k-2 with exactly k maxima 7
 0, 3, 2, 120, 80, 15, 4760, 3552, 860, 64, 249984, 199168, 57064, 6576, 220, 17512704, 14548480, 4643712, 681984, 42112, 672, 1599330304, 1367568384, 469942528, 80506880, 6849792, 242688, 1904, 185616337920, 162107703296, 58754129408 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A singly defective permutation omits one value and repeats another value T(1,1) is zero because there are no defective permutations of a single element Table starts ....0......3.....120.....4760....249984...17512704.1599330304 ....2.....80....3552...199168..14548480.1367568384 ...15....860...57064..4643712.469942528 ...64...6576..681984.80506880 ..220..42112.6849792 ..672.242688 .1904 LINKS R. H. Hardin, Table of n, a(n) for n = 1..36 EXAMPLE Some solutions for n=4 with 2 maxima (6,1,4,4,3,2) (4,3,1,5,6,6) (4,2,1,2,3,5) (3,2,1,6,4,3) (5,5,6,1,2,3) CROSSREFS Sequence in context: A323745 A109899 A002297 * A152017 A076931 A076932 Adjacent sequences:  A183267 A183268 A183269 * A183271 A183272 A183273 KEYWORD nonn,tabl AUTHOR R. H. Hardin Jan 03 2011 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.

Last modified December 12 22:06 EST 2019. Contains 329963 sequences. (Running on oeis4.)