A134595 -id:A134595 - cp's OEIS frontend

A132187 a(n) pertains to numbers x such that, for any m, the number formed from the first m digits of x is congruent to n mod m; but no digit can be appended to maintain the condition. a(n) is the quantity of such numbers.

294, 268, 284, 260, 264, 281, 261, 286, 267, 244, 292, 265, 286, 300, 260, 293, 297, 281, 274, 262, 240, 259, 277, 296, 306, 266, 280, 259, 263, 284, 265, 293, 287, 259, 287, 273, 270, 298, 245, 257, 286, 257, 292, 272, 264, 286, 287, 310, 294, 268, 257

Offset: 0

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

The smallest number for each n is A134595, the largest is A132185.

Cf. A051883, A132185, A134595.

Edited by Don Reble, Nov 07 2007

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

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

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

			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.

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

Edited by Don Reble, Nov 07 2007

cp's OEIS Frontend

A132187 a(n) pertains to numbers x such that, for any m, the number formed from the first m digits of x is congruent to n mod m; but no digit can be appended to maintain the condition. a(n) is the quantity of such numbers.

Views

Author

Keywords

Comments

Crossrefs

Extensions