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.

A120001 Where record values of A119999 occur.

Original entry on oeis.org

0, 10, 12, 21, 102, 112, 123, 213, 312, 412, 512, 612, 712, 812, 912, 1012, 1023, 1123, 1213, 1234, 1324, 1423, 2113, 2134, 3124, 4123, 5123, 6123, 7123, 8123, 9123, 10123, 10234, 11213, 11234, 12134, 12345, 13245, 14235, 15234, 16234, 17234, 18234, 19234, 21134, 21345
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 13 2006

Keywords

Comments

A120000(n)=A119999(a(n)) and A119999(m) < A120000(n) for m
problem: smallest m>1023456789 such that A119999(m)>A119999(1023456789)?
From David A. Corneth, Sep 07 2022: (Start)
Does every term >= 10 contain the digit 1?
Does every term >= 12 contain the digits 1 and 2?
Does every term >= 1023 contain the digits 1, 2 and 3?
Does every term >= 11234 contain the digits 1, 2, 3 and 4?
Does every term >= 112345 contain the digits 1, 2, 3, 4 and 5? (End)

Examples

			21 is in the sequence as A119999(21) = 12 and 12 is the largest value of A119999(k) for k in [0, 21]. - _David A. Corneth_, Sep 07 2022
		

Crossrefs

Extensions

More terms from David A. Corneth, Sep 07 2022