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.

A358947 a(n) = 2^m(n), where m(n) is the number of distinct primes, neither 2 nor 7, dividing A358946(n).

Table of values

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

List of values

[1, 1, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 4, 2, 2, 2, 4, 2, 2, 4, 2, 2, 4, 4, 2, 2, 2, 2, 2, 2, 2, 4, 4, 2, 2, 2, 2, 4, 2, 4, 2, 2, 4, 2, 4, 2, 2, 2, 2, 2, 4, 2, 2, 2, 4, 2, 2, 2, 2, 2, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 4, 4, 4, 2, 4, 2, 4, 4, 4, 2, 4, 4, 2, 4, 4]

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

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