cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A268846 Number of sequences with n copies each of 1,2,...,10 and longest increasing subsequence of length 10.

Table of values

n a(n)
1 1
2 248040482741
3 9891092676022013399311
4 195676681342450229063393365876181
5 2683885055441747960475755652405552969614101
6 29539005031390270063835072245497576346701114916209911
7 282011782951614089942684801199121868144180995938610087493133121

List of values

[1, 248040482741, 9891092676022013399311, 195676681342450229063393365876181, 2683885055441747960475755652405552969614101, 29539005031390270063835072245497576346701114916209911, 282011782951614089942684801199121868144180995938610087493133121]