login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 2

%I #3 Oct 19 2017 03:15:07

%S 144408645048225636603816,1725676121534561296189,

%T 188276429246387492222,19838179232721317143537,

%U 12764828245698443284086,176903816597810123057,18626438463030625206604,19352559475935751347112,16128296082816884008108

%N 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.

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

%e 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.

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

%K nonn,base,easy

%O 0,1

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

%E Edited by _Don Reble_, Nov 07 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 19 08:00 EDT 2024. Contains 375284 sequences. (Running on oeis4.)