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.

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

Table of values

n a(n)
1 1
2 248749
3 20117051281
4 1077273394836829
5 47342758641593552281
6 1878320344216429026862153
7 70803267480031877368227941803
8 2612508237897293571677286548812861
9 96042041352156959435669839199503441435
10 3553102771891168237056005934820411063204249

List of values

[1, 248749, 20117051281, 1077273394836829, 47342758641593552281, 1878320344216429026862153, 70803267480031877368227941803, 2612508237897293571677286548812861, 96042041352156959435669839199503441435, 3553102771891168237056005934820411063204249]