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.

A257403 Multiplicative with a(2) = 1, a(2^e) = 0 if e>1, a(3^e) = 0^e, a(p^e) = e+1 if p == 1, 3 (mod 8), a(p^e) = (1 + (-1)^e) / 2 if p == 5, 7 (mod 8).

Table of values

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

List of values

[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 2, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 2, 0, 2, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 0, 0, 2, 0]

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

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