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.

A035935 Smallest number that always takes at least n steps to reach 0 under "k -> any product of 2 numbers whose concatenation is k".

Original entry on oeis.org

0, 1, 11, 26, 39, 77, 666
Offset: 0

Views

Author

Keywords

Comments

Next term is at least 3*10^7. 666 may be the last term. - Naohiro Nomoto, Apr 07 2001
Checked up to 1.55*10^10. No other numbers apart 666 with minimal path of length 6. The largest number found with minimal path equal to 5 is 711111. - Giovanni Resta, Oct 03 2012

Crossrefs