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.

A110390 a(n) = F(n) mod s(n) where s(n) is the sum of the digits of the n-th Fibonacci number F(n).

Table of values

n a(n)
7 1
8 0
9 6
10 5
11 4
12 0
13 1
14 3
15 1
16 3
17 13
18 0
19 9
20 21
21 6
22 14
23 13
24 9
25 13
26 2
27 1
28 18
29 18
30 9
31 1
32 9
33 2
34 3
35 30
36 0
37 12
38 21
39 38
40 3
41 27
42 38
43 2
44 3
45 2
46 13
47 3
48 18
49 34
50 1
51 5
52 3
53 28
54 0
55 1
56 21
57 14
58 38
59 1
60 18
61 40
62 1
63 2
64 30
65 65
66 21
67 34
68 48
69 64
70 55
71 45
72 0
73 49
74 33
75 60
76 63
77 3
78 24
79 5
80 21
81 2

List of values

[1, 0, 6, 5, 4, 0, 1, 3, 1, 3, 13, 0, 9, 21, 6, 14, 13, 9, 13, 2, 1, 18, 18, 9, 1, 9, 2, 3, 30, 0, 12, 21, 38, 3, 27, 38, 2, 3, 2, 13, 3, 18, 34, 1, 5, 3, 28, 0, 1, 21, 14, 38, 1, 18, 40, 1, 2, 30, 65, 21, 34, 48, 64, 55, 45, 0, 49, 33, 60, 63, 3, 24, 5, 21, 2]

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

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