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.

A358359 a(n) = number of occurrences of n in A128440; i.e., as a number [k*r^m], where r = golden ratio = (1+sqrt(5))/2, k and m are positive integers, and [ ] = floor.

Table of values

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

List of values

[1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 2, 1, 2, 1, 3, 1, 1, 1, 3, 2, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 3, 2, 1, 1, 2, 1, 1, 2, 2, 3, 1, 1, 2, 2, 1, 2, 1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 2, 1, 1, 2, 3, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1]