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.

A216131 a(n) = 11^n mod 1000.

Table of values

n a(n)
0 1
1 11
2 121
3 331
4 641
5 51
6 561
7 171
8 881
9 691
10 601
11 611
12 721
13 931
14 241
15 651
16 161
17 771
18 481
19 291
20 201
21 211
22 321
23 531
24 841
25 251
26 761
27 371
28 81
29 891
30 801
31 811
32 921
33 131
34 441
35 851
36 361
37 971
38 681
39 491
40 401
41 411
42 521
43 731
44 41
45 451
46 961
47 571
48 281
49 91
50 1
51 11
52 121
53 331
54 641
55 51
56 561
57 171
58 881
59 691
60 601

List of values

[1, 11, 121, 331, 641, 51, 561, 171, 881, 691, 601, 611, 721, 931, 241, 651, 161, 771, 481, 291, 201, 211, 321, 531, 841, 251, 761, 371, 81, 891, 801, 811, 921, 131, 441, 851, 361, 971, 681, 491, 401, 411, 521, 731, 41, 451, 961, 571, 281, 91, 1, 11, 121, 331, 641, 51, 561, 171, 881, 691, 601]

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

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