The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A268871 Number of sequences in {1,...,n}^n with longest increasing subsequence of length four. 2
 1, 96, 4501, 161876, 5179791, 157279903, 4678809652, 138712471261, 4137680201304, 124857897038252, 3823102196348462, 118974270767513360, 3765555655525713427, 121224440332571253975, 3968401901135750428284, 132031213465208461376221, 4461459275271493097987384 (list; graph; refs; listen; history; text; internal format)
 OFFSET 4,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 4..50 CROSSREFS Column k=4 of A245667. Sequence in context: A285171 A239182 A035150 * A017812 A035743 A035809 Adjacent sequences:  A268868 A268869 A268870 * A268872 A268873 A268874 KEYWORD nonn AUTHOR Alois P. Heinz, Feb 15 2016 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 1 12:40 EST 2021. Contains 349429 sequences. (Running on oeis4.)