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.

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.

Table of values

n a(n)
0 294
1 268
2 284
3 260
4 264
5 281
6 261
7 286
8 267
9 244
10 292
11 265
12 286
13 300
14 260
15 293
16 297
17 281
18 274
19 262
20 240
21 259
22 277
23 296
24 306
25 266
26 280
27 259
28 263
29 284
30 265
31 293
32 287
33 259
34 287
35 273
36 270
37 298
38 245
39 257
40 286
41 257
42 292
43 272
44 264
45 286
46 287
47 310
48 294
49 268
50 257

List of values

[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]

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

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