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.

A378513 a(1) = 1, a(n) = a(n-1) + n if all the digits of a(n-1) do not share a divisor greater than 1. Otherwise, a(n) = a(n-1) divided by the gcd of all its individual digits.

Table of values

n a(n)
1 1
2 3
3 1
4 5
5 1
6 7
7 1
8 9
9 1
10 11
11 22
12 11
13 24
14 12
15 27
16 43
17 60
18 10
19 29
20 49
21 70
22 10
23 33
24 11
25 36
26 12
27 39
28 13
29 42
30 21
31 52
32 84
33 21
34 55
35 11
36 47
37 84
38 21
39 60
40 10
41 51
42 93
43 31
44 75
45 120
46 166
47 213
48 261
49 310
50 360
51 120
52 172
53 225
54 279
55 334
56 390
57 130
58 188
59 247
60 307
61 368
62 430

List of values

[1, 3, 1, 5, 1, 7, 1, 9, 1, 11, 22, 11, 24, 12, 27, 43, 60, 10, 29, 49, 70, 10, 33, 11, 36, 12, 39, 13, 42, 21, 52, 84, 21, 55, 11, 47, 84, 21, 60, 10, 51, 93, 31, 75, 120, 166, 213, 261, 310, 360, 120, 172, 225, 279, 334, 390, 130, 188, 247, 307, 368, 430]