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.

A249148 a(1) = 1, after which, if a(n-1) = 1, a(n) = 1 + the total number of 1's that have occurred in the sequence so far, otherwise a(n) = the total number of times the least prime dividing a(n-1) [i.e., A020639(a(n-1))] occurs as a divisor (counted with multiplicity for each term) in the previous terms from a(1) up to and including a(n-1).

Table of values

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

List of values

[1, 2, 1, 3, 1, 4, 3, 2, 4, 6, 7, 1, 5, 1, 6, 8, 11, 1, 7, 2, 12, 14, 15, 6, 16, 20, 22, 23, 1, 8, 26, 27, 10, 28, 30, 31, 1, 9, 13, 2, 32, 37, 1, 10, 38, 39, 14, 40, 43, 1, 11, 3, 15, 16, 47, 1, 12, 49, 7, 8, 52, 54, 55, 9, 22, 56, 59, 1, 13, 5, 10, 60, 62, 63, 25, 14, 64, 70, 71, 1, 14, 72, 75, 28, 77, 15, 29, 1, 15, 30, 78, 79, 1, 16, 83]