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.

Showing 1-1 of 1 results.

A132185 a(n) is the largest number beginning with 1 such that, for any m, the number formed from the first m digits of a(n) is congruent to n mod m.

Original entry on oeis.org

144408645048225636603816, 1725676121534561296189, 188276429246387492222, 19838179232721317143537, 12764828245698443284086, 176903816597810123057, 18626438463030625206604, 19352559475935751347112, 16128296082816884008108
Offset: 0

Views

Author

Philippe LALLOUET (philip.lallouet(AT)orange.fr), Nov 04 2007

Keywords

Comments

Obviously, each such number has at least ten digits; thence one can extend with diminishing probability. But a(211131)=1715193991236363935195556991413939 has 34 digits!

Examples

			a(3) = 19838179232721317143537 because 19 == 3 mod 2, 198 == 3 mod 3, 1983 == 3 mod 4,..., 19838179232721317143537 == 3 mod 23; but no additional digit makes a 3 mod 24 number.

Crossrefs

Cf. A051883, A109032, A113538, A132187, A134595.

Extensions

Edited by Don Reble, Nov 07 2007
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.