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.

A316707 For any n >= 0 with base-5 expansion Sum_{k=0..w} d_k * 5^k, let f(n) = Sum_{k=0..w} [d_k > 0] * (2 + i)^k * i^(d_k - 1) (where [] is an Iverson bracket and i denotes the imaginary unit); a(n) equals the square of the modulus of f(n).

Table of values

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

List of values

[0, 1, 1, 1, 1, 5, 10, 8, 2, 4, 5, 4, 10, 8, 2, 5, 2, 4, 10, 8, 5, 8, 2, 4, 10, 25, 32, 34, 20, 18, 50, 61, 61, 41, 41, 40, 45, 53, 37, 29, 10, 13, 17, 9, 5, 20, 29, 25, 13, 17, 25, 18, 32, 34, 20, 20, 17, 29, 25, 13, 50, 41, 61, 61, 41, 40, 29, 45, 53, 37, 10]